Abstract
Let A be any abstract set. We call A an alphabet. Finite sequences of elements of A are called expressions in A. Finite sequences of expressions are called texts.
Gelegentlich ergreifen wir die Feder Und schreiben Zeichen auf ein weisses Blatt, Die sagen dies und das, es kennt sie jeder, Es ist ein Spiel, das seine Regeln hat. H. Hesse, “Buchstaben”
We now and then take pen in hand And make some marks on empty paper. Just what they say, all understand. It is a game with rules that matter. H. Hesse, “Alphabet”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer Science+Business Media New York
About this chapter
Cite this chapter
Manin, Y.I. (1977). Introduction to formal languages. In: A Course in Mathematical Logic. Graduate Texts in Mathematics, vol 53. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4385-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4385-2_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-4387-6
Online ISBN: 978-1-4757-4385-2
eBook Packages: Springer Book Archive