1 votes 1 votes we know that PDA = FA+1stack so why we use the stack data structure in PDA, we have much more data structure like linked liste,queue, array or tree/hashing??? Theory of Computation pushdown-automata + – Hira Thakur asked Sep 1, 2017 Hira Thakur 769 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes One of the big reason is matching like genrally we do in (a^n b^n ) and push and pop does it in O(1) nikunj answered Sep 1, 2017 nikunj comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes In stack we do all operations at the top of the stack. We push at the top, we pop from the top. So we do not need any move operation in stack to compare anything. To accept CFL, we need something like this. Ahwan answered Sep 1, 2017 Ahwan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes PDA has been defined using stack. Although We can implement using different data structures but if power of Automata’s acceptance increases or decrease we may have to put it in different class of Languages i.e it may or may not be CFL anymore. aaaakash001 answered Oct 6, 2022 aaaakash001 comment Share Follow See all 0 reply Please log in or register to add a comment.