default search action
50. Birthday: Jürgen Dassow , 1997
- Gheorghe Paun, Arto Salomaa:
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday). Lecture Notes in Computer Science 1218, Springer 1997, ISBN 3-540-62844-4
Chapter 1: Regulated Rewriting
- Henning Bordihn:
A Grammatical Approach to the LBA Problem. 1-9 - Henning Fernau, Markus Holzer:
Conditional Context-Free Languages of Finite Index. 10-26 - Alexander Meduna:
On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. 27-38 - Victor Mitrana, Ralf Stiebe:
The Accepting Power of Finite Automata over Groups. 39-48 - Peter R. J. Asveld:
Controlled Fuzzy Parallel Rewriting. 49-70 - Paolo Bottoni, Giancarlo Mauri, Piero Mussio:
On Controlling Rewriting by Properties of Strings and Symbols. 71-94 - Henning Fernau, Rudolf Freund:
Accepting Array Grammars with Control Mechanisms. 95-118 - Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
On Restarting Automata with Rewriting. 119-136
Chapter 2: Cooperating Distributed Grammar Systems
- Valeria Mihalache, Victor Mitrana:
Deterministic Cooperating Distributed Grammar Systems. 137-149 - Tudor Balanescu, Horia Georgescu, Marian Gheorghe:
Grammar Systems with Counting Derivation and Dynamical Priorities. 150-166 - Sorina Dumitrescu:
Characterization of RE Using CD Grammar Systems with Two Registers and RL Rules. 167-177 - Dietmar Wätjen:
On Cooperating Distributed Uniformly Limited 0L Systems. 178-196 - Maurice H. ter Beek:
Teams in Grammar Systems: Sub-Context-Free Cases. 197-216 - Mohamed Amin:
A Note on the Incomparability of the EOL Family with Certain Families of Languages Generated by Cooperating Grammar Systems. 217-219 - Jozef Kelemen:
Colonies as Models of Reactive Systems. 220-235 - Petr Sosík, Leos Stýbnar:
Grammatical Inference of Colonies. 236-246
Chapter 3: Parallel Communicating Grammar Systems
- Karl R. Abrahamson, Liming Cai, Steve Gordon:
A Grammar Characterization of Logarithmic-Space Computation. 247-255 - Stefan D. Bruda:
On the Computational Complexity of Context-Free Parallel Communicating Grammar Systems. 256-266 - Daniel Popescu:
Parallel Communicating Grammar Systems with Communication by Signals. 267-277 - Adrian Chitu:
PC Grammar Systems Versus Some Non-Context-Free Constructions from Natural and Artificial Languages. 278-287 - María Dolores Jiménez-López, Carlos Martín-Vide:
Grammar Systems for the Description of Certain Natural Language Facts. 288-298 - Erzsébet Csuhaj-Varjú, Arto Salomaa:
Networks of Parallel Language Processors. 299-318
Chapter 4: Splicing Systems
- Claudio Zandron, Claudio Ferretti, Giancarlo Mauri:
A Reduced Distributed Splicing System for RE Languages. 319-329 - Gianina Georgescu:
On the Generative Capacity of Splicing Grammar Systems. 330-345 - Kamala Krithivasan, Venkatesan T. Chakaravarthy, Raghavan Rama:
Array Splicing Systems. 346-365
Chapter 5: Infinite Words
- Juraj Hromkovic, Juhani Karhumäki:
Two Lower Bounds on Computational Complexity of Infinite Words. 366-376 - Ludwig Staiger:
On omega-power Languages. 377-394 - Alexandru Mateescu, George Daniel Mateescu, Grzegorz Rozenberg, Arto Salomaa:
Shuffle-like Operations on omega-words. 395-411
Chapter 6: Algebraic Appcoaches to Languages
- Werner Kuich:
Generalized Lindenmayerian Algebraic Systems. 412-421 - Virgil Emil Cazanescu:
The Structure of the Basic Morphisms. 422-429 - Manfred Kudlek, Alexandru Mateescu:
On Mix Operation. 430-439 - Markus Holzer, Klaus-Jörn Lange:
On the Complexity of Iterated Insertions. 440-453 - Lucian Ilie:
The Decidability of the Generalized Confluence Problem for Context-Free Languages. 454-464
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.