Peter Linz Edition 4 Exercise 7.3 Question 18 (Page No. 200)

Question

Give an example of a deterministic context-free language whose reverse is not deterministic.

Comments

How is the reverse Non Deterministic? Can you please explain it a bit. I am not getting it.

---

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}$ }

---

@imShreyas@iishapandey77

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