To our families The formal language theory was born in the middle of our century as a tool for modelling and investigating the syntax of natural languages, and it has been developed mainly in connection with programming language handling. Of course, one cannot deny the impulses from neuronal net investigations, from logic, as well as the mathematical motivation of the early researches. The theory has rapidly become a mature one, with specific problems, techniques and results and with an internal self-motivated life. Abstract enough to deal with the essence of modelled phenomena, formal language theory has been applied during the last years to many further non-linguistical fields, sometimes surprisingly far from the previous areas of applications; such fields are developmental biology, economic modelling, semiotics of folklore, dramatic and musical works, cryptography, sociology, psychology, and so on. All these applications as well as the traditional ones to natural and programming languages revealed a rather common conclusion: very frequently, context-free gram- mars, the most developed and the most "tractable" type of Chomsky grammars, are not sufficient. "The world is non-context-free" (and we shall "prove" this statement in Section 0.4). On the other hand, the context-sensitive grammars are too powerful and definitely "intractable" (many problems are undecidable or are still open; there is no semantic interpretation of the nonterminals an so on). This is the reason to look for intermediate generative devices, conjoining the simpli- city and the beauty of context-free grammars with the power of context-sensitive ones.
| ISBN: | 9783642749346 |
| Publication date: | 13th December 2011 |
| Author: | Jürgen Dassow, Gheorghe Paun |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 308 pages |
| Series: | Monographs in Theoretical Computer Science. An EATCS Series |
| Genres: |
Mathematical theory of computation |