Regulated Rewriting in Formal Language Theory by Gheorghe Paun
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.-
Fundamentals of Algebraic Graph Transformation
-
Models and Algorithms of Time-Dependent Scheduling
-
Theoretical Aspects of Distributed Computing in Sensor Networks
-
Handbook of Weighted Automata
-
Coping with Selfishness in Congestion Games
-
First-Order Programming Theories
-
Restricted-Orientation Convexity
-
Fault-Tolerant Search Algorithms
-
Patterns in Permutations and Words
-
Semantic Integration of Heterogeneous Software Specifications
-
Theoretical Aspects of Local Search
-
Computability
-
Syntax-Directed Semantics
-
The Logic of Partial Information
-
Computing in Horn Clause Theories
-
Nonsequential Processes
-
Data Structures and Algorithms 3
-
Relations and Graphs
-
Fundamentals of Algebraic Specification 1
-
Iteration Theories
-
Semirings, Automata, Languages
-
Data Structures and Algorithms 1
-
Petri Nets
-
Kolmogorov Complexity and Computational Complexity
-
Temporal Logic of Programs
-
Confluent String Rewriting
-
Fundamentals of Algebraic Specification 2
-
Parsing Theory
-
Finiteness and Regularity in Semigroups and Formal Languages
-
Coloured Petri Nets
-
Algorithms in Combinatorial Geometry
-
Logics of Specification Languages
-
Graph and Model Transformation
-
Unfoldings
-
Stochastic Coalgebraic Logic
-
Process Algebras for Petri Nets
| SKU | Unavailable |
| ISBN 13 | 9783642749346 |
| ISBN 10 | 3642749348 |
| Title | Regulated Rewriting in Formal Language Theory |
| Author | Gheorghe Paun |
| Series | Monographs In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 2011-12-13 |
| Number of pages | 308 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |