Abstract
In this chapter we want to formulate the problems of equivalence, reduction, minimization and realization as well as some basic notions concerning the transition monoid and the structure theory of automata. In order to give a motivation for the constructions in the following chapters we will sketch the problems and the corresponding results for the case of deterministic automata in such a way that they can be generalized to automata in monoidal categories of deterministic type (cf. 1.12). For a categorical theory of decomposition and synthesis of automata we refer the reader to [18]. Unless otherwise specified automata are always deterministic in this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1974 B. G. Teubner, Stuttgart
About this chapter
Cite this chapter
Ehrig, H., Kiermeier, KD., Kreowski, HJ., Kühnel, W. (1974). Some Problems in Automata Theory. In: Universal Theory of Automata. Teubner Studienbücher Informatik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-96644-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-322-96644-5_3
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-519-02054-7
Online ISBN: 978-3-322-96644-5
eBook Packages: Springer Book Archive