Abstract
An online automaton 1 (OA, for short) is an abstract device that is a “pure” state-transition system. To hone your intuiton for the formal specification of OAs, consider Figure 3.1, which depicts a finite OA2—which we shall later (in the next chapter, in fact) call a finite automaton (FA, for short and finite automata in the plural). One can think about an OA M as a simple machine that communicates with the world via
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
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag New York
About this chapter
Cite this chapter
Rosenberg, A.L. (2010). Online Automata: Exemplars of “State”. In: The Pillars of Computation Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09639-1_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-09639-1_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-56117-2
Online ISBN: 978-0-387-09639-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)