A Turing Machine is defined by $M=(Q,,,,qO$;$B,F)$

Q A finite set of states

$,$ A finite input alphabet, which is a subset of $-\{B\}$

$$ A finite tape alphabet, which is a strict superset of $$

B A distinguished blank symbol, which is in $$

qO The initial$/$starting state, $qO$ is in $Q$

F A set of final$/$accepting states, which is a subset of $Q$

$\frac{?}{\text{b}\text{a}\text{r}}(0)$

A next$-$move function, which is a mapping $($i$.$e$.,$ may be undefined$)$ from