Abstract
What is a language? By consulting a dictionary one finds, among others, the following explanations:
-
1
The body of words and systems for their use common to people who are of the same community or nation, the same geographical area, or the same cultural tradition.
-
2
Any set or system of signs or symbols used in a more or less uniform fashion by a number of people who are thus enabled to communicate intelligibly with one other.
-
3
Any system of formalized symbols, signs, gestures, or the like, used or conceived as a means of communicating thought, emotion, etc.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Chomsky, “Three models for the description of language”, IRE Trans. on Information Theory, 2: 3 (1956) 113–124.
T. V. Gamkrelidze, V. V. Ivanov, “The Early History of Indo-European Languages”, Scientific American, March, (1990), 82–89.
L. H. Haines, “On free monoids partially ordered by embedding”, J. Combinatorial Theory, 6 (1969) 94–98.
G. H. Higman, “Ordering by divisibility in abstract algebras”, Proc. London Math. Soc., 3, (1952) 326–336.
A. Lindenmayer, “Mathematical models for cellular interactions in development”, I, II, J. Theoret. Biol., 18, (1968) 280–315.
R. C. Lyndon, M. P. Schützenberger, “The equation a m = b n c p in a free group”, Michigan Math. J., 9, (1962) 289–298.
G. Păun, A. Salomaa, “Formal Languages”, in CRC Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen (ed.), to appear.
E. Post, “Finite combinatory processes-formulation”, I, J. Symbolic Logic, 1, (1936) 103–105.
P. E. Ross, “Hard Words”Scientific American, April (1991) 70–79.
A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockville, 1981.
A. Thue, “Über unendliche Zeichenreihen”, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Kristiania, 7, (1906) 1–22.
A. Thue, “Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen”, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Kristiania, 1, (1912) 1–67.
A. M. Turing, “On computable numbers with an application to the Entscheidungsproblem”, Proc. London Math. Soc., 2, 42, (1936) 230–265. A correction, ibid., 43, 544–546.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mateescu, A., Salomaa, A. (1997). Formal Languages: an Introduction and a Synopsis. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59136-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-59136-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63863-3
Online ISBN: 978-3-642-59136-5
eBook Packages: Springer Book Archive