State true or false:Statement: Turing Machine can change symbols on it – McqOptions

MCQOPTIONS

1.	State true or false: Statement: Turing Machine can change symbols on its tape, whereas the FA cannot change symbols on tape.
A.	true
B.	false
Answer» B. false

Discussion

No Comment Found

Related MCQs

For the following language, an enumerator will print:<br>L={a<sup>n</sup>b<sup>n</sup>|n>=0}
Enumerator is a turing machine with __________
State true or false:<br>Statement: Turing Machine can change symbols on its tape, whereas the FA cannot change symbols on tape.
X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell holding one symbol.<br>Name X?