0 votes 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 asked Dec 12, 2018 Guilherme Zanini Mor 527 views answer comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Dec 12, 2018 reply Follow Share 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 votes 0 votes Please log in or register to add a comment.