Abstract
The basic concepts for automata in closed categories have already been studied in chapter 4. Now we want to show that the behavior construction can be extended to a behavior functor which satisfies the Minimal Realization Principle stated in 3.6. By theorem 3.6 we get a systematic of automata in closed categories which has a minimal, realizing and reduced subsystematic. Thus it is possible to apply all the general results of chapter 3 to automata in closed categories. Especially we now get all the results concerning reduction, minimization and realization,which were sketched for the deterministic case in chapter 2, now for automata in arbitrary closed categories satisfying the general assumptions in 4.1. For examples we refer to the list in 4.9.
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.
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). Reduction and Minimization of Automata in Closed Categories. In: Universal Theory of Automata. Teubner Studienbücher Informatik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-96644-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-322-96644-5_6
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