Abstract
This chapter provides an introduction to the theory of regular languages and finite automata. These concepts will be used in the following chapters for describing behaviors of asynchronous circuits and for specifying abstract behaviors. The theory of regular languages and finite automata is now well established as one of the important basic tools of computer science. We present this theory in a somewhat different way than is done in most textbooks, because we feel that our approach is more general and permits us to establish the relationship between regular languages and finite automata in a very natural way. For a general introduction to regular languages and finite automata, see one of the many texts on this subject, for example [65, 77, 100, 120]; for material closer to our treatment see [16, 17, 20].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Brzozowski, J.A., Seger, CJ.H. (1995). Regular Languages and Finite Automata. In: Asynchronous Circuits. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4210-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4210-9_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8698-1
Online ISBN: 978-1-4612-4210-9
eBook Packages: Springer Book Archive