138 views
0 votes
0 votes

If L is a CFL and R si regular, then L/R is[/->quotient]

(A) Regular
(B) CFL but not regular
(C) Recursive but not CFL
(D) None of the above

And

Comment on following statements

1.CFL / Regular = CFL

2.CFL / CFL = Recursively Enumerable

3.​Recursively Enumerable / Recursively Enumerable = Recursively Enumerable

​true for both left quotient and right quotient

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
!KARAN asked Dec 8, 2018
325 views
Let us say we assume last production rule to be $A \rightarrow \epsilon$The language generated by the given grammar will be something like $L = \{c, bcb, b^2cb^2, b^3cb^3...