Deterministic finite automaton for (1|0)*10
| 0 | 1 | |
|---|---|---|
| > A | A | B |
| B | C | B |
| * C | A | B |
Non-deterministic finite automaton for (1|0)*10
| 0 | 1 | |
|---|---|---|
| > a | a | ab |
| b | c | ϕ |
| * c | ϕ | ϕ |
Context-free grammar for unary addition
S → aSa | +aEa
E → aEa | =
Push-down automaton for unary addition
S → aSa | +aEa
E → aEa | =
Recursive-descent parser for arithmetic
Turing machine
Ref: Simulator by A Rajab