0 votes 0 votes Give an example of a deterministic context-free language whose reverse is not deterministic. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-language + – Naveen Kumar 3 asked Jun 23, 2019 Naveen Kumar 3 464 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply shivanisrivarshini commented Jun 23, 2019 reply Follow Share https://cs.stackexchange.com/questions/30702/are-dcfls-closed-under-reversal 0 votes 0 votes sakharam commented Nov 6, 2019 i moved by sakharam Nov 10, 2019 reply Follow Share S-->aSb | b ==REVERSE==> S-->bSa|b (Non Deterministic) 0 votes 0 votes imShreyas commented Nov 7, 2019 reply Follow Share How is the reverse Non Deterministic? Can you please explain it a bit. I am not getting it. 0 votes 0 votes iishapandey77 commented Nov 7, 2019 reply Follow Share 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 votes 1 votes sakharam commented Nov 10, 2019 reply Follow Share @imShreyas@iishapandey77 Yes its reverse is also a deterministic language, Thanks for letting me know. 0 votes 0 votes Please log in or register to add a comment.