0 votes 0 votes Given , L={0n10n | n>=1} is it CFL.? If yes what is its Grammer? Theory of Computation context-free-language + – Biki_diki asked Dec 27, 2016 retagged Oct 13, 2017 by Arjun Biki_diki 203 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes it is DCFLas it will be accepted by DPDA how ?? push comming zero's and when 1 comes we came to know that now after this when 0's come will will pop the already present zero in the stack . hence making it DCFL SO CFL ALSO grammer: S---> 0S0 /1 focus _GATE answered Dec 27, 2016 selected Dec 27, 2016 by sudsho focus _GATE comment Share Follow See all 0 reply Please log in or register to add a comment.