start p2 p1 p0 0/0, 1/1, 2/2… 0/0, 1/1, 2/2… 0/0, 1/1, 2/2… 0/0, 1/1, 2/2… 0/0, 1/1, 2/2… 0/_0, 1/_1, 2…
The machine as drawn — 4 states, 60 transitions.
The author’s examples, run 7 → accept · 7 42 → accept · 42 123 → accept · 123 1234 → accept · 1_234 12345 → accept · 12_345 1234567 → accept · 1_234_567
Definition $$ \begin{aligned} M &= (Q, \Sigma, \Delta, \delta, \lambda, q_0, F) \\Q &= \{ \text{start}, p_{2}, p_{1}, p_{0} \} \\\Sigma &= \{ \text{0}, \text{1}, \text{2}, \text{3}, \text{4}, \text{5}, \text{6}, \text{7}, \text{8}, \text{9} \} \\\Delta &= \{ \text{0}, \text{1}, \text{2}, \text{3}, \text{4}, \text{5}, \text{6}, \text{7}, \text{8}, \text{9}, \text{\_} \} \\q_0 &= \text{start} \\F &= \{ p_{0} \} \\\delta &: Q \times (\Sigma \cup \{\varepsilon\}) \to \mathcal{P}(Q) \\\lambda &: Q \times (\Sigma \cup \{\varepsilon\}) \times Q \to \Delta^* \end{aligned} $$
Verified by the library ✓ Tests pass — 6 examples checked
Machine code fa.0123456789.0123456789_@v:(00B00C00D)(01B01C01D)(02B02C02D)(03B03C03D)(04B04C04D)(05B05C05D)(06B06C06D)(07B07C07D)(08B08C08D)(09B09C09D)_00D01D02D03D04D05D06D07D08D09D_00B01B02B03B04B05B06B07B08B09B_+1000C1001C1002C1003C1004C1005C1006C1007C1008C1009C
Size 4 states · 60 transitions Level Advanced Licence Creative Commons Attribution 4.0 Tags formatting nondeterminism guessing