decode carry 0 carry 1 and or xor not done
The machine as drawn — 8 states, 53 transitions.
The author’s examples, run 1101,0110,+,ε → accept 1101,0110,&,ε → accept 1101,0110,|,ε → accept 1101,0110,^,ε → accept 1101,ε,~,ε → accept
Definition $$ \begin{aligned} M &= (Q, \Sigma, \Gamma, \delta, q_0, F) \\Q &= \{ \text{decode}, \text{carry 0}, \text{carry 1}, \text{and}, \text{or}, \text{xor}, \text{not}, \text{done} \} \\\Sigma &= \{ \text{0}, \text{1}, \text{+}, \text{\&}, \text{|}, \text{\textasciicircum{}}, \text{\textasciitilde{}} \} \\\Gamma &= \{ \text{0}, \text{1}, \text{+}, \text{\&}, \text{|}, \text{\textasciicircum{}}, \text{\textasciitilde{}}, \text{$\sqcup$} \} \\q_0 &= \text{decode} \\F &= \{ \text{done} \} \\\delta &: Q \times \Gamma^{4} \to Q \times \Gamma^{4} \times \{L, R, S\}^{4} \end{aligned} $$
Verified by the library ✓ Tests pass — 5 examples checked ✓ Deterministic Machine code tm4.%26%2B01%5E%7C%7E@h:--------(*10*S*S1S0SB*20*S*S2S0SC*50*S*S5S0SD*60*S*S6S0SE*70*S*S7S0SF)_(0100S0S1S0SZ3100R3R1S3RB4100R4R1S3RB)--(0103R0R1S3RB3103R3R1S3RB4103R4R1S3RB)(0104R0R1S3RB3104R3R1S3RB4104R4R1S4RB)---_(0200S0S2S0SZ3200R3R2S3RC4200R4R2S4RC)--(0203R0R2S3RC3203R3R2S3RC4203R4R2S4RC)(0204R0R2S4RC3204R3R2S4RC4204R4R2S3RG)---_(0500S0S5S0SZ3500R3R5S3RD4500R4R5S4RD)--(0503R0R5S3RD3503R3R5S3RD4503R4R5S4RD)(0504R0R5S4RD3504R3R5S4RD4504R4R5S3RD)---_(0600S0S6S0SZ3600R3R6S3RE4600R4R6S4RE)--(0603R0R6S3RE3603R3R6S3RE4603R4R6S4RE)(0604R0R6S4RE3604R3R6S4RE4604R4R6S4RE)---_0700S0S7S0SZ--0703R0R7S4RF0704R0R7S3RF---_(0200R0R2S4RZ3200R3R2S4RC4200R4R2S3RG)--(0203R0R2S4RC3203R3R2S4RC4203R4R2S3RG)(0204R0R2S3RG3204R3R2S3RG4204R4R2S4RG)---Size 8 states · 53 transitions · 4 tapes Level Intermediate Licence Creative Commons Attribution 4.0 Tags showcase mtm