LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
TM is more powerful than FSM because
|
|
The tape movement is confined to one direction
|
|
|
It has no finite state control
|
|
|
It has the capability to remember arbitrary long sequences of input symbols
|
|
|
None of these
|
Explanation:
Detailed explanation-1: -(a)the tape movement is confined to one direction. (b)it has no finite state control. (c)it has the capability to remember arbitrary long sequences of input symbols.
Detailed explanation-2: -Turing machines are more powerful than both finite automata and pushdown automata. They are as powerful as any computer we have ever built.
Detailed explanation-3: -But only a Turning machine can recognise a sequence that has an arbitrary number of As followed by the same number of Bs. That is a Turing machine is more powerful than a finite state machine because it can count.
There is 1 question to complete.