Abstract
In this chapter we will extend our theory to automata with fixed initial state, called initial automata. The initial state will be given by a K-morphism a:U → S where U is the unit object in the monoidal category (K,⊗,U) and S the state object of an automaton. If A is a deterministic type automaton and U ={1} the initial state is for example defined by a(1)∈S. The behavior of an initial automaton is defined as being the input-output morphism of the initial state.
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). Initial Automata. In: Universal Theory of Automata. Teubner Studienbücher Informatik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-96644-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-322-96644-5_10
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