2 votes 2 votes Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ... Theory of Computation theory-of-computation regular-expression context-free-language + – Vicky rix asked Apr 5, 2017 • retagged Jul 4, 2017 by Arjun Vicky rix 429 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes i hope it might help.......... akash.dinkar12 answered Apr 5, 2017 • selected Apr 5, 2017 by Prashant. akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes as L is DCFL so it's complement surely will be DCFL bcl DCFL is closed under complementation. 2018 answered Apr 5, 2017 2018 comment Share Follow See all 2 Comments See all 2 2 Comments reply Vishal Goyal commented Jun 21, 2017 reply Follow Share can anyone say me where can i get single soure where i can get all the closure properties of all languages 0 votes 0 votes varunraj commented Mar 17, 2018 reply Follow Share https://gatecse.in/closure-property-of-language-families/ 0 votes 0 votes Please log in or register to add a comment.
