Term
| Formal definition of a Context Free Grammar |
|
Definition
|
|
Term
| Formal definition of what it means for a string to be immediately derived from another string |
|
Definition
|
|
Term
| Formal definition of a pushdown automaton |
|
Definition
|
|
Term
| Interpretation of an element of the transition relation |
|
Definition
|
|
Term
| Formal definition of a configuration and the 'yield' operation in PDA |
|
Definition
|
|
Term
| Formal definition of computation by a PDA |
|
Definition
|
|
Term
| Closure properties of context free languages |
|
Definition
|
|
