E
edge of a graph efficiency of computation empty set
end markers for an lba enumeration procedure equivalence
classes
of automata classes of dfa's and nfa's of grammars
Mealy and Moore machines relation
extended output function extended transition function for dfa's
for finite-state transducers for nfa's
F
final state
finite automata finite-state transducer fst
formal languages functions
computable
domain
partial
range
total
G
Gödel, K.
grammars
context-free
context-sensitive left-linear
linear
regular
right-linear
simple
unrestricted
graphs
labeled
Greibach normal form GTG