An FSM (Finite State Machine) can be considered to be a TM (Turing Machine) of finite tape length
| A. | without rewinding capability and unidirectional tape movement. |
| B. | rewinding capacity, and unidirectional tape movement |
| C. | without rewinding capability and bidirectional tape movement |
| D. | rewinding capability and bidirectional tape movement |
Answer : A Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
