A Note on Multiple-Entry Finite Automata


Recently, Gill and Kou [1] introduced the multiple-entry finite automaton (mefa). I t is a deterministic finite automaton (dfa) with no specified initial state (i.e., it accepts if there is a sequence of transitions, starting from any state and ending in a final state). They showed that the class of languages accepted by mefa's is the class of regular… (More)
DOI: 10.1016/S0022-0000(76)80006-2

Cite this paper

@article{Galil1976ANO, title={A Note on Multiple-Entry Finite Automata}, author={Zvi Galil and Janos Simon}, journal={J. Comput. Syst. Sci.}, year={1976}, volume={12}, pages={350-351} }