10
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Parallel decision procedures for finite state automata

&
Pages 33-40 | Received 11 Dec 1992, Accepted 15 Mar 1992, Published online: 30 Mar 2007
 

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.

C.R. Categories:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.