Abstract
Finite state automata provide one of the oldest and best known models used in computer science. We take advantage here of certain recent results to give a short and elegant presentation of their algebraic theory.
Ideals are like the stars: we never reach them, but like the mariners of the sea, we chart our course by them.
Carl Schurz
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
© 2000 Springer-Verlag London
About this chapter
Cite this chapter
Ştefănescu, G. (2000). Automata. In: Network Algebra. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0479-7_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0479-7_9
Publisher Name: Springer, London
Print ISBN: 978-1-85233-195-5
Online ISBN: 978-1-4471-0479-7
eBook Packages: Springer Book Archive