series-parallel-loop construction (3.5, 3.6) ≥ NFA ⊃

First Page		Document Content
Date: 2004-11-18 06:12:15 Applied mathematics Nondeterministic finite automaton Deterministic finite automaton Powerset construction Regular expression Regular language Automata theory Theoretical computer science Computer science		series-parallel-loop construction (3.5, 3.6) ≥ NFA ⊃ Add to Reading List Source URL: www.jn.inf.ethz.ch Download Document from Source Website File Size: 160,13 KB Share Document on Facebook