1 votes 1 votes In the below diagram which solution is correct and why ? Theory of Computation theory-of-computation pushdown-automata + – dragonball asked Oct 29, 2017 dragonball 346 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes first solution is correct for the given language. In second solution, after getting equal no. of a's and b's, you can able to put only one 'c' . In general second solution is accepting = {a^n b^n c d | n>0} Akash Mittal answered Nov 14, 2017 Akash Mittal comment Share Follow See all 2 Comments See all 2 2 Comments reply Harish Kumar 2 commented Nov 14, 2017 reply Follow Share Hi Akash, I think if we add on emore transition to Solution 2 (i.e. c,c/cc) to state 2 then both the solutions are correct. And i will go with 2nd one as it will be minimal PDA. Well both the solutions will be correct after adding this transition. What do you think? 0 votes 0 votes dragonball commented Nov 18, 2017 reply Follow Share Yes, It was a real confusion and i also got confused while solving . @habibkhan plz give ur views . 0 votes 0 votes Please log in or register to add a comment.