in Theory of Computation
434 views
0 votes
0 votes

in Theory of Computation
by
434 views

1 Answer

2 votes
2 votes

Your answer is correct.

Operation Regular DCFL CFL CSL Recursive RE
Union yes no yes yes yes yes
Intersection yes no no yes yes yes
Complement yes yes no yes yes no
Concatenation yes no yes yes yes yes
Kleene star yes no yes yes yes yes
Homomorphism yes no yes no no yes
ϵ-free Homomorphism yes no yes yes yes yes
Substitution (ϵ-free) yes no yes yes no yes
Inverse Homomorphism yes yes yes yes yes yes
Reverse yes no yes yes yes yes
Intersection with a regular language yes yes yes yes yes yes

http://gatecse.in/closure-property-of-language-families/ Reffer this.

1 comment

Thanks for taking time to answer this.
0
0

Related questions