cellular automaton | Non-deterministic Turing machine | Automaton Transfusion | Pushdown automaton | God Is An Automaton | Deterministic automaton | Automaton clock |
A special subclass of context-free languages are the deterministic context-free languages which are defined as the set of languages accepted by a deterministic pushdown automaton and can be parsed by a LR(k) parser.