Lets assume I have this turing machine:
And I have a $\Sigma = \{0,1,2,3,4,5\}$.
Now my question is can I simplify the transaction from $A$ to $B$ ?
Is there any way so I can write - when the read value is not $2$, write $x$ and move to right?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this communityLets assume I have this turing machine:
And I have a $\Sigma = \{0,1,2,3,4,5\}$.
Now my question is can I simplify the transaction from $A$ to $B$ ?
Is there any way so I can write - when the read value is not $2$, write $x$ and move to right?
You could write $\neq 2 \to x,R$, but you might have to explain somewhere that by that you mean that the transition is taken as long as the symbol read is not $2$.
More generally, you can use whatever notation you want as long as you explain it and it's unambiguous.
This is the answer of a practical mathematician. Your professor could have different ideas.
Maybe you can write sth like "Σ\2 → x, R" on the transition. But as Yuval Filmus mentioned, the notations always depend on the lecturer.