symbol
alphabet
string
language
substring
DFA
NFA
accept (as in, a machine accepting a language)
regular expression over a given alphabet
minimal DFA
Kleene closure
palindrome
context-free grammar
The language generated by a given context-free grammar
unambiguous
ambiguous
inherently ambiguous
leftmost derivation
parse tree (also known as derivation tree), parser