41 votes 41 votes The language accepted by a Pushdown Automaton in which the stack is limited to $10$ items is best described as Context free Regular Deterministic Context free Recursive Theory of Computation gatecse-2002 theory-of-computation easy identify-class-language + – Kathleen asked Sep 15, 2014 edited Feb 20, 2018 by kenzou Kathleen 8.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 50 votes 50 votes Correct Option: B With only finite positions in stack, we can have only finite configurations and these can also be modeled as states in a finite automata. Arjun answered Jun 6, 2015 edited May 6, 2021 by soujanyareddy13 Arjun comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Pathki Shivamsh commented Aug 26, 2020 reply Follow Share @avraw We can construct DFA for a^nb^n for n<10 as it is regular 0 votes 0 votes ankit3009 commented Nov 18, 2021 reply Follow Share As there is a finite number of items mentioned that is 10 items. So, a FA is always possible. That’s why regular language is best described. Can we say conclude this answer with the above statement? 0 votes 0 votes Shakyaji commented Dec 16, 2021 reply Follow Share @Sachin Mittal 1, using this approach, we will have at most 10 states, Finite State automata which generates Regular Grammar. please verify. 0 votes 0 votes Please log in or register to add a comment.