Abstract
Consider a finite automaton having an input alphabet of k symbols and 1 binary output.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Chinal, J. (1973). Regular Expressions and Regular Events. In: Design Methods for Digital Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-86187-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-86187-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-86189-5
Online ISBN: 978-3-642-86187-1
eBook Packages: Springer Book Archive