1 votes 1 votes IS one state sufficient for an empty stack PDA? Needs explanation ! Theory of Computation pushdown-automata + – Aboveallplayer asked Aug 2, 2016 Aboveallplayer 583 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Empty stack means nothing in the stack and NULL string accepted only. So, it is not only a CFL but also a Regular language. One state is sufficient for designing such DFA without any transition srestha answered Aug 2, 2016 • selected Aug 2, 2016 by Aboveallplayer srestha comment Share Follow See all 3 Comments See all 3 3 Comments reply Arjun commented Aug 2, 2016 reply Follow Share The question is ambiguous- but I guess it means "accept by empty stack". 0 votes 0 votes Aboveallplayer commented Aug 2, 2016 reply Follow Share Ya. .... accaepting 0 votes 0 votes Aboveallplayer commented Aug 2, 2016 reply Follow Share I think the above answer is correct and it satisfied my need of explanation... so i am selecting it as the BEST . arjun sir and other moderators can revert it any time if required :D 0 votes 0 votes Please log in or register to add a comment.
