TM is more powerful than FSM because

Related MCQs

• What is the reason behind a Turing machine is more powerful than finite state machine FSM?
• FSM can recognize
• Basic limitation of FSM is that it
• A FSM can be considered, having finite tape length without rewinding capability and unidirectional tape movement
• State table of an FSM is given below. There are two states A And B, one input and one output. Let the initial state be A = 0 and B = 0. To take the machine to the state A = 0 and B = 1 with output = 1 the minimum length of input string required will be
• Grammar that produce more than one Parse tree for same sentence is:
• The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:
• The PDA is called non-deterministic PDA when there are more than one out going edges from……… state
• How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?