in Theory of Computation
301 views
0 votes
0 votes
Give an example of a deterministic context-free language whose reverse is not deterministic.
in Theory of Computation
301 views

4 Comments

How is the reverse Non Deterministic? Can you please explain it a bit. I am not getting it.
0
0
The example given by you presents a deterministic language. L={$a^{n}b ^{n+1}$}  and reversal is Lr={$b^{n+1}a^{n}$}. Both are deterministic. The language can be L={$a^{n}b^{2n} \cup ca^{n}b^{n}$ }
1
1

@imShreyas@iishapandey77

Yes its reverse is also a deterministic language,  Thanks for letting me know.

0
0

Please log in or register to answer this question.

Related questions