Q. A FSM can be considered, having finite tape length without rewinding capability and unidirectional tape movement (Solved)
1. Turing machine
2. Pushdown automata
3. Context free languages
4. Regular languages
- a. Turing machine
1. Turing machine
2. Pushdown automata
3. Context free languages
4. Regular languages