Abstract
A multiple entry finite automaton (mefa) can be viewed as a set of finite automata acting in parallel but in a compacted form. Mefas are defined in a similar manner to finite automata except that any state can be initial. Unlike finite automata, they cannot be minimised in a unique way. We show that the usual minimisation process applied to mefas is unnecessarily weak. We propose a more natural alternative. This solves a current problem and provides a unique (in a restricted sense) minimal structure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Gill and L.-T. Kou Multiple entry finite automata, Journal of Computer and System Sciences, 9, (1974), 1–19.
R. Valk Minimal machines with several initial states are not unique, Information and Control 31, (1976), 193–196.
P.A.S. Veloso Networks of finite state machines. Doctoral dissertation, University of California, Berkeley, May 1975.
P.A.S. Veloso and A. Gill On mimimal finite automata with several initial states, Information and Control, submitted for publication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Haebich, W., Lassez, JL. (1981). Minimisatin of multiple entry finite automata. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091820
Download citation
DOI: https://doi.org/10.1007/BFb0091820
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10883-2
Online ISBN: 978-3-540-38792-3
eBook Packages: Springer Book Archive