Abstract

Minimization of deterministic finite automata has traditionally required complicated programs and correctness proofs, and taken O ( n k log n ) time, where n is the number of states and k the size of the alphabet. Here a short, memory-efficient program is presented that runs in O ( n + m log m ) , or even in O ( n + m log n ) , time, where m is the number of transitions. The program is complete with input, output, and the removal of irrelevant parts of the automaton. Its invariant-style correctness proof is relatively short.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.