Deterministic finite automaton for (1|0)*10
Non-deterministic finite automaton for (1|0)*10
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
Ref: Parser by B E Harmansa
Turing machine
Ref: Simulator by A Rajab