NFA minimization
From HandWiki
In automata theory (a branch of theoretical computer science), NFA minimization is the task of transforming a given nondeterministic finite automaton (NFA) into an equivalent NFA that has a minimum number of states, transitions, or both. While efficient algorithms exist for DFA minimization, NFA minimization is PSPACE-complete.[1] No efficient (polynomial time) algorithms are known, and under the standard assumption P ≠ PSPACE, none exist. The most efficient known algorithm is the Kameda‒Weiner algorithm.[2]
Non-uniqueness of minimal NFA
Unlike deterministic finite automata, minimal NFAs may not be unique. There may be multiple NFAs of the same size which accept the same regular language, but for which there is no equivalent NFA or DFA with fewer states.
References
- ↑ Jiang, Tao; Ravikumar, B. (1993), "Minimal NFA Problems are Hard", SIAM Journal on Computing 22 (6): 1117–1141, doi:10.1137/0222067, https://doi.org/10.1137/0222067
- ↑ "On the State Minimization of Nondeterministic Finite Automata". IEEE Transactions on Computers (IEEE) C-19 (7): 617–627. August 1970. doi:10.1109/T-C.1970.222994. https://www.researchgate.net/publication/3045459. Retrieved 2020-05-03.
External links
- A modified C# implementation of Kameda-Weiner (1970) [1]
 |  |
