1. DLT 1995:
Magdeburg,
Germany
Jürgen Dassow,
Grzegorz Rozenberg,
Arto Salomaa (Eds.):
Developments in Language Theory II,
At the Crossroads of Mathematics,
Computer Science and Biology,
Magdeburg,
Germany,
17-21 July 1995. World Scientific,
Singapore,
1996,
ISBN 981-02-2682-9
Sequences and Codes
Classical Theory of Languages and Automata
- Gianina Georgescu:
The Orthogonality of Some Complexity Measures of Context-Free Languages.
73-78
- Peter Gvozdjak, Branislav Rovan:
Time-Bounded Parallel Rewriting.
79-87
- Markus Holzer:
On Emptiness and Counting for Alternating Finite Automata.
88-97
- Masami Ito:
Height Functions and Linear Languages.
98-101
- Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel:
Restarting Automata, Marcus Grammars and Context-Free Languages.
102-111
- Joanna Jedrzejowicz:
An Undecidable Problem for Shuffle Languages.
112-118
- Lila Kari, Gabriel Thierrin:
Morphisms and Associated Congruences.
119-128
- Manfred Kudlek, Alexandru Mateescu:
Rational and Algebraic Languages with Distributed Catenation.
129-138
- Marjo Lipponen:
On F-Prime Solutions of the Post Correspondence Problem.
139-147
- Codrut Matei, Ferucio Laurentiu Tiplea:
(0, 1)-Total Pure Context-Free Grammars.
148-153
- Kai Salomaa, Sheng Yu:
Nondeterminism Degrees for Context-Free Languages.
154-165
- Ina Schiering, Wolfgang Thomas:
Counter-Free Automata, First-Order Logic and Star-Free Expressions.
166-175
- Andreas Weber:
Transforming a Single-Valued Transducer Into a Mealy Machine.
176-185
Controlled Derivations and Grammar Systems
- Igor Baník:
Colonies as Systems of Turing Machines Without States.
189-198
- Henning Bordihn, Henning Fernau:
Accepting Grammars and Systems: An Overview.
199-208
- Liming Cai:
The Computational Complexity of PCGS with Regular Components.
209-219
- Rudolf Freund:
Array Grammars with Prescribed Teams of Array Productions.
220-229
- Stefan Gärtner:
On Partition Limited OL Systems.
230-236
- Juraj Hromkovic:
On the Communication Complexity of Distributive Language Generation.
237-246
- Valeria Mihalache:
Szilard Languages Associated to Parallel Communicating Grammar Systems.
247-256
- Owen Rambow:
Imposing Vertical Context Conditions on Derivations.
257-266
- Giorgio Satta:
The Membership Problem for Unordered Vector Languages.
267-275
Many Dimensions and Graphs
- Heiko Dörr:
Computing an Upper Bound for SVS(gg) by Abstract Interpretation.
279-288
- Frank Drewes:
On the Connectedness of Pictures Defined by Iterated Function Systems.
289-298
- Dora Giammarresi:
Finite State Recognizability for Two-Dimensional Languages: A Brief Survey.
299-308
- Peter Hartmann:
Efficient Subgraph Matching Within Cellular Hypergraphs.
309-318
- Yoshimasa Kimura, Takehiro Tokuda:
Timed Attribute Hypergraph Grammars and Their Based Properties.
319-328
- Ralf Stiebe:
Some New Decision Results for Edge Grammars.
329-338
Infinite Words
Languages and Concurrency
Other Devices
Applications
- Peter R. J. Asveld:
Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition.
443-453
- Blanca Cases:
From Synonymy to Self-Modifying Automata: Q-Diam Language.
454-459
- José Fortes Gálvez:
A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning.
460-465
- Radu Gramatovici:
Introducing the Operational Parser.
466-471
- Mark-Jan Nederhof:
Reversible Pushdown Automata and Bidirectional Parsing.
472-481
- Ulrich Nitsche:
A Finitary-Language Semantics for Propositional Linear Temporal Logic.
482-489
Copyright © Tue Dec 1 16:13:12 2009
by Michael Ley (ley@uni-trier.de)
