Nondeterministic finite automaton: Difference between revisions

Content deleted Content added
Tag: Reverted
Reverting edit(s) by Eldiem22 (talk) to rev. 1233092892 by David Eppstein: Unexplained content removal (RW 16.1)
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]]