0 votes 0 votes Is the language $L =$ {$a^nb^n : n ≥ 1$} $∪$ {$a$} 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 298 views answer comment Share Follow See 1 comment See all 1 1 comment reply shivanisrivarshini commented Jun 23, 2019 reply Follow Share yes 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes DCFL is closed under union with Regular language. sakharam answered Nov 6, 2019 sakharam comment Share Follow See all 0 reply Please log in or register to add a comment.