Sold Out
Book Categories |
Ch. 1 | Regulated Rewriting | 1 |
A Grammatical Approach to the LBA Problem | 1 | |
Conditional Context-Free Languages of Finite Index | 10 | |
On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations | 27 | |
The Accepting Power of Finite Automata over Groups | 39 | |
Controlled Fuzzy Parallel Rewriting | 49 | |
On Controlling Rewriting by Properties of Strings and Symbols | 71 | |
Accepting Array Grammars with Control Mechanisms | 95 | |
On Restarting Automata with Rewriting | 119 | |
Ch. 2 | Cooperating Distributed Grammar Systems | 137 |
Deterministic Cooperating Distributed Grammar Systems | 137 | |
Grammar Systems with Counting Derivation and Dynamical Priorities | 150 | |
Characterization of RE Using CD Grammar Systems with Two Registers and RL Rules | 167 | |
On Cooperating Distributed Uniformly Limited 0L Systems | 178 | |
Teams in Grammar Systems: Sub-Context-Free Cases | 197 | |
A Note on the Incomparability of the EOL Family with Certain Families of Languages Generated by Cooperating Grammar Systems | 217 | |
Colonies as Models of Reactive Systems | 220 | |
Grammatical Inference of Colonies | 236 | |
Ch. 3 | Parallel Communicating Grammar Systems | 247 |
A Grammar Characterization of Logarithmic-Space Computation | 247 | |
On the Computational Complexity of Context-Free Parallel Communicating Grammar Systems | 256 | |
Parallel Communicating Grammar Systems with Communication by Signals | 267 | |
PC Grammar Systems Versus Some Non-Context-Free Constructions from Natural and Artificial Languages | 278 | |
Grammar Systems for the Description of Certain Natural Language Facts | 288 | |
Networks of Parallel Language Processors | 299 | |
Ch. 4 | Splicing Systems | 319 |
A Reduced Distributed Splicing System for RE Languages | 319 | |
On the Generative Capacity of Splicing Grammar Systems | 330 | |
Array Splicing Systems | 346 | |
Ch. 5 | Infinite Words | 366 |
Two Lower Bounds on Computational Complexity of Infinite Words | 366 | |
On [omega]-power Languages | 377 | |
Shuffle-Like Operations on [omega]-words | 395 | |
Ch. 6 | Algebraic Approaches to Languages | 412 |
Generalized Lindenmayerian Algebraic Systems | 412 | |
The Structure of the Basic Morphisms | 422 | |
On Mix Operation | 430 | |
On the Complexity of Iterated Insertions | 440 | |
The Decidability of the Generalized Confluence Problem for Context-Free Languages | 454 | |
Author Index | 465 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionNew Trends in Formal Languages, Vol. 121
X
This Item is in Your InventoryNew Trends in Formal Languages, Vol. 121
X
You must be logged in to review the productsX
X
X
Add New Trends in Formal Languages, Vol. 121, This book presents a collection of refereed papers on formal language theory arranged for the occasion of the 50th birthday of Jürgen Dassow, who has made a significant contribution to the areas of regulated rewriting and grammar systems. The volume c, New Trends in Formal Languages, Vol. 121 to the inventory that you are selling on WonderClubX
X
Add New Trends in Formal Languages, Vol. 121, This book presents a collection of refereed papers on formal language theory arranged for the occasion of the 50th birthday of Jürgen Dassow, who has made a significant contribution to the areas of regulated rewriting and grammar systems. The volume c, New Trends in Formal Languages, Vol. 121 to your collection on WonderClub |