Multiple-entry finite automata

Authors:
Arthur Gill;Lawrence T. Kou
Affiliations:
Department of Electrical Engineering and Computer Sciences University of California, Berkeley, California 94720, USA and Electronics Research Laboratory, University of California, Berkeley, Califo ...;Department of Electrical Engineering and Computer Sciences University of California, Berkeley, California 94720, USA and Electronics Research Laboratory, University of California, Berkeley, Califo ...
Venue:
Journal of Computer and System Sciences
Year:
1974

Citing 0
Cited 13

State complexity of basic language operations combined with reversal

Information and Computation
Determination of finite automata accepting subregular languages

Theoretical Computer Science
On NFAs where all states are final, initial, or both

Theoretical Computer Science
A note on multiple-entry finite automata

Journal of Computer and System Sciences
Automata with extremal minimality conditions

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata

RP'10 Proceedings of the 4th international conference on Reachability problems
Decision problems for convex languages

Information and Computation
Structurally unambiguous finite automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Quotient complexity of closed languages

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity in convex languages

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Extremal minimality conditions on automata

Theoretical Computer Science
Contextual Grammars with Subregular Choice

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Quotient Complexity of Closed Languages

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A multiple-entry finite automaton (mefa) is a finite automaton where any state can serve as an initial state. The reason for studying such automata is that there is a class of regular sets which can be recognized much more economically with a parallel bank of identical mefa's than with conventional finite automata. In this paper we study properties of mefa's and formulate a necessary and sufficient condition for regular sets to be mefa-recognizable. We also develop algorithms for testing for this condition and for constructing the recognizing mefa whenever this conditions is satisfied.