TA_FLAT

2. Hierarchical representation of the generation of a string from a grammar.
7. Property describing two automata that accept the same language.
8. A Turing machine that can simulate any other Turing machine via encoding.
9. Fundamental operations in the stack of a PDA.
10. Represents the null or empty string in automata theory.
12. CFG form where every production begins with a terminal symbol.
13. Rules describing operations under which language families remain closed.
14. Machine that recognizes context-sensitive languages.
15. Type of regular grammar where terminals appear to the right of non-terminals.

1. Hypothesis equating effectively computable functions with Turing-computable ones.
3. A language recognized by a finite automaton or described by a regular expression.
4. Class of languages accepted by a Turing machine that may not halt for some inputs.
5. Computational concept allowing multiple possible transitions from a state.
6. Process of reducing the number of states in a DFA without changing its language.
11. Denotes the alphabet set in formal language theory.
13. Operation of joining two strings end-to-end.