Abstract
Automata are usually abstractions of information-processing devices. They generally perform one of the two following symbol-processing tasks: they recognize languages or compute partial functions from Σ* into ∆*, where Σ, ∆ are finite alphabets.
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.
References
Aho, A.V. (ed.): Currents in the theory of computing. New York: Prentice-Hall, 1973.
Aho, A.V., Ullman, J.D.: The theory of languages, Mat. Syst. Theory 2 (2): 97–126. 1968.
Aho, A.V., Hoperoft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley, 1975.
Hoperoft, J.E., Ullman, J.D.: Formal languages and their relations to automata. Reading, Mass.: Addison-Wesley, 1969.
Mazurkiewicz, A., Pawlak, Z. (eds.): Mathematical foundations of computer science. Warsaw: PWN, 1977.
Minsky, M.: Finite and infinite machines. New York: Prentice-Hall, 1967.
Neumann, J. von: Theory of self-reproducing automata, edited and completed by A.W. Burks. Urbana, University of Illinois Press, 1966.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Skowron, A. (1981). Automata. In: Marciszewski, W. (eds) Dictionary of Logic as Applied in the Study of Language. Nijhoff International Philosophy Series, vol 9. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1253-8_7
Download citation
DOI: https://doi.org/10.1007/978-94-017-1253-8_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8257-2
Online ISBN: 978-94-017-1253-8
eBook Packages: Springer Book Archive