They can be seen in one of two intuitive, equivalent ways:
- one-tape, read-only Turing Machines with tape limited to cells initially containing input
- 1DFAs that can go backwards while reading input symbols
They characterize Regular Languages in both the deterministic (2DFA) and nondeterministic (2NFA) versions.