Revision as of 06:46, 7 July 2024 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,723 edits →Equivalence to NFA: clarify ← Previous edit		Revision as of 04:25, 30 August 2024 edit undo Eldiem22 (talk \| contribs) 1 edit m →Closure properties Tag: Reverted Next edit →
Line 223: Intersection; similarly, from ''A''<sub>1</sub> and ''A''<sub>2</sub> an NFA ''A''<sub>i</sub> can be constructed that accepts ''L''<sub>1</sub>∩''L''<sub>2</sub>. Concatenation Negation; similarly, from ''A''<sub>1</sub> an NFA ''A''<sub>n</sub> can be constructed that accepts Σ<sup></sup>\''L''<sub>1</sub>. *[[Kleene closure]]

Nondeterministic finite automaton: Difference between revisions