🎴 Flashcard Mode
UGC NET June 2004 - Computer Science Paper 2
Card1 / 50
Mastered0
Review0
QuestionClick to flip
An FSM can be considered to be a TM (Turning machine)
AnswerClick to flip back
A
of finite tape length, that does not has rewinding capability and unidirectional tape movement
💡 Explanation:
A Finite State Machine (FSM) can be modeled as a Turing Machine with a finite tape length, no rewinding capability, and unidirectional tape movement (read-only).