Answer:
The class of language the machines recognise is Regular Language (See Explanation Below)
Explanation:
Given
Form δ : Q × Γ → Q × Γ × {R, S}
From the above transition form, it can be seen that the machine cannot read square symbols passed to it.
Regarding the square the machine is currently reading, there are multiple movement of S and it shouldn't be so because any number of the multiple movement can be simulated by exactly one movement of S.
As stated earlier that sequence of moves can be simulated by just one movement.
Let R = the movement
This means the machine can only use right move efficiently.
With this, we can say that the machine only read input string.
This is a characteristic of DFA (Deterministic Finite Automata).
With this, we can conclude that some DFAs will simulate the Turing machine and that they only read regular language.
The class of language that a Turing machine (TM) recognize are regular languages only.
A Turing machine (TM) can be defined as a hypothetical machine or computational model that was proposed in 1936 by Alan M. Turing. He develop it to perform computations by reading and writing symbols to an infinite tape based on a table of rules.
The transition function of a Turing machine with stay put instead of left is given by this expression:
[tex]\delta : Q \times T \rightarrow Q \times T \times \{R, S\}[/tex]
From the transition function, we can deduce that we can esaily simulate any deterministic finite automaton (DFA) on a Turing machine with stay put instead of left. However, neither can the TM move left nor can't it read anything that is written on the infinite tape as soon as it moves to the right. Thus, there is only a one-way access to the TM's input.
In conclusion, you should add a new symbol to the transition function so that the TM won't write any blank on the infinite tape.
Read more on Turing machine here: https://brainly.com/question/1678976
