![](https://dblp.uni-trier.de/img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Grammars, Volume 2
Volume 2, Number 1, 1999
- Gennaro Costagliola, Shi-Kuo Chang:
Using Linear Positional Grammars for the LR Parsing of 2-D Symbolic Languages. 1-34 - Joanna Jedrzejowicz:
Structural Properties of Shuffle Automata. 35-51 - Stefan Müller:
An HPSG-Analysis for Free Relative Clauses in German. 53-105
Volume 2, Number 2, 1999
- Joan Busquets:
The Polarity Parameter for Ellipsis Coherence. 107-125 - Wolfgang Minker:
Stochastically-Based Semantic Analysis for ARISE - Automatic Railway Information Systems for Europe. 127-147 - Victor Mitrana:
Patterns and Languages: An Overview. 149-173
Volume 2, Number 3, December 1999
- Rodica Ceterchi:
Cut-and-Paste Languages. 179-188 - Rudolf Freund:
Generalized P-Systems with Splicing and Cutting/Recombination. 189-199 - Radu Gramatovici:
Shuffle-Based Multilanguages. 201-210 - Renate Klempien-Hinrichs:
The Generative Power of Context-free Node Rewriting in Hypergraphs. 211-221 - Frantisek Mráz
, Martin Plátek, Martin Procházka:
On Special Forms of Restarting Automata. 223-233 - Petr Sosík:
Conditional Tabled Eco-Grammar Systems: the Scattered Contexts. 235-245 - Ludwig Staiger
:
On the Power of Reading the Whole Infinite Input Tape. 247-257 - Christian Wartena:
On the Concatenation of One-Turn Pushdowns. 259-269 - Vladimir A. Zakharov:
On the Decidability of the Equivalence Problem for Orthogonal Sequential Programs. 271-281 - Michal Zemlicka
, Jaroslav Král:
Run-time Extensible Deterministic Top-Down Parsing. 283-293
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.