Deterministic finite automaton: Difference between revisions

Content deleted Content added
Spanier and Rose each cover two of these three closure properties
No edit summary
Tag: Reverted
Line 299:
{{DEFAULTSORT:Deterministic Finite-State Machine}}
[[Category:Finite automata]]
[[Category:NP-complete problems]]