1 votes 1 votes L = {cambndn} Please draw PDA for this Language! Theory of Computation theory-of-computation pushdown-automata context-free-language dcfl + – iarnav asked Sep 19, 2017 iarnav 1.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes PDA For this Agrima answered Nov 17, 2017 Agrima comment Share Follow See all 3 Comments See all 3 3 Comments reply sripo commented Oct 11, 2018 reply Follow Share This looks correct to me,is this the correct answer? 0 votes 0 votes Agrima commented Oct 12, 2018 reply Follow Share Yes, but still you can verify this. 0 votes 0 votes aaaakash001 commented Oct 6, 2022 reply Follow Share Answer is wrong. strings like ac, bac , abc all are being accepted here. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Correct me .... and sorry for the handwriting though Pawan Kumar 2 answered Sep 19, 2017 Pawan Kumar 2 comment Share Follow See all 4 Comments See all 4 4 Comments reply iarnav commented Sep 20, 2017 reply Follow Share @Pawan Kumar 2 How's (a,c/aac) How c become TOS? 0 votes 0 votes Pawan Kumar 2 commented Sep 20, 2017 reply Follow Share Thanks for pointing me out... how about this ? again corrct me :) 0 votes 0 votes ankit_thawal commented Jan 13, 2018 reply Follow Share Why are we storing "a"? We don't need "a" for any further comparisons. 0 votes 0 votes aaaakash001 commented Oct 6, 2022 reply Follow Share Answer is wrong. strings like ac all are being accepted here. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L = {ca^m b^n d^n} considering m,n>=1 after reading c state must be changed to avoid strings of type ’ac’ also for reading b’s state must be changed. aaaakash001 answered Oct 6, 2022 aaaakash001 comment Share Follow See all 0 reply Please log in or register to add a comment.
