Abstract
In chapter 4 we have generalized finite automata to a wider class of structures, finite transition systems, and we have extended the run method to extend the notion of behavior. Via subset construction we showed this larger class of structures to still have periodic behavior only. Such results are useful; they provide additional freedom to describe periodic sets, that is, automata behavior. Stated differently, to show that an event is periodic it suffices to show it to be definable by a transition system. We made use of this freedom in section 4.4, to show that regular events are periodic. In this chapter we will find a large extension of finite transition systems to structures we call regular canonical systems. To extend the notion of behavior adequately, we will have to abandon the run idea. Its place will be taken by the notion of a formal deduction (or proof), which plays a central role in modern logic and linguistics.
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer Science+Business Media New York
About this chapter
Cite this chapter
Büchi, J.R., Siefkes, D. (1989). Regular Canonical Systems. In: Siefkes, D. (eds) Finite Automata, Their Algebras and Grammars. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8853-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8853-1_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8855-5
Online ISBN: 978-1-4613-8853-1
eBook Packages: Springer Book Archive