Abstract
A new technique is presented for solving, in parallel, the classification problem of finite state automata: given a finite state machine M, is L(M) empty, finite or infinite. This method employs the reachability information implicit in the transition matrix of the automata and hence is effective for both deterministic and nondeterministic finite state machines. Previous approaches required an exponential amount of acceptance testing of long strings. We present a parallel algorithm and combinatorial circuit which requires only O(n) time, where n is the number of states of the automata.
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 callDisclaimer: 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.
