2,315 views

Finite automata requires minimum ____________ number of stacks.

1. $1$
2. $0$
3. $2$
4. None of the options

finite automata requires no stack. hence the option B is correct.
FA requires no stack , If stack is added it will be PDA and if 2 stacks are added it is similar to Turing Machine.
by

1
1,138 views