Introduction to formal languages
Part of the Graduate Texts in Mathematics book series (GTM, volume 53)
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.
KeywordsFormal Language Atomic Formula Riemann Hypothesis Homological Algebra Unordered Pair
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.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media New York 1977