0 0 votes L = { a^m b^n c^k=m+n } Please draw PDA for this Language! Theory of Computation theory-of-computation pushdown-automata dpda + – Guilherme Zanini Mor 778 views answer comment Share Follow Print See 1 comment 1 1 comment reply Shaik Masthan commented Dec 12, 2018 reply Follow flag push x into the stack on seeing a or b. pop x from the stack if you see c, at the end stack should be empty 0 0 replyShare Please log in or register to add a comment.
