C

Path of E moves

informally, the E-closure of a state q is the set of all states reachable from q via a _ _ _ _

Delta’ (q,a)

formula, all states reachable form q by paths labeled a or E

Structural Induction

any regular expression can be converted to an equivalent E-NFA, we do this by

Finite Automata equals Regular Expressions

proof of Kleene’s Theorem

Stephen Kleene

proponent of Kleene’s theorem

grep

was just an editor command in primitive line editors in UNIX machines

Global Regular Expressions Print

meaning of grep

Uniplexed Information and Computing System

meaning of UNIX