Abstract
Defined and studied by Kleene in connection with a simple model of the neuron, regular languages (also called finite-state languages) have been applied to the field of circuit construction and have given rise to numerous results there. These languages were also encountered in another form by Markov, who also recognized their linguistic application. More recently, Shannon has taken up these questions again from the same probabilistic viewpoint as Markov. He applied them to natural languages and defined a special class of automata: the finite automata.
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
© 1970 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Gross, M., Lentin, A. (1970). Kleene Languages and Finite Automata. In: Introduction to Formal Grammars. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87129-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-87129-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-87131-3
Online ISBN: 978-3-642-87129-0
eBook Packages: Springer Book Archive