Volume 3,
Number 1,
2000
Volume 3,
Numbers 2/3,
2000
- Introduction.
83-87 BibTeX
- Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemonte de la Clergerie:
Tabulation of Automata for Tree-Adjoining Languages.
89-110 BibTeX
- Pierre Boullier:
A Cubic Time Extension of Context-Free Grammars.
111-131 BibTeX
- Corinna Cortes, Mehryar Mohri:
Context-Free Recognition with Weighted Automata.
133-150 BibTeX
- Robert Frank, Seth Kulick, K. Vijay-Shanker:
Monotonic C-Command: A New Perspective on Tree Adjoining Grammar.
151-173 BibTeX
- Martin Kappes:
Combining Contextual Grammars and Tree Adjoining Grammars.
175-187 BibTeX
- Hans-Peter Kolb, Uwe Mönnich, Frank Morawietz:
Descriptions of Cross-Serial Dependencies.
189-216 BibTeX
- Alexander Koller, Joachim Niehren, Kristina Striegnitz:
Relaxing Underspecified Semantic Representations for Reinterpretation.
217-241 BibTeX
- Alain Lecomte:
Proof-Nets, Hybrid Logics and Minimalist Representations.
243-257 BibTeX
- Rani Nelken, Nissim Francez:
The Algebraic Semantics of Interrogative NPs.
259-273 BibTeX
- Dick Oehrle:
Context-Sensitive Node Admissibility.
275-293 BibTeX
- Gerald Penn:
The Algebraic Structure of Transitive Closure and its Application to Attributed Type Signatures.
295-312 BibTeX
Copyright © Sat May 16 23:59:39 2009
by Michael Ley (ley@uni-trier.de)