4. DLT 1999: Aachen, Germany

Grzegorz Rozenberg, Wolfgang Thomas (Eds.): Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999. World Scientific 2000, ISBN 981-02-4380-4 BibTeX

@proceedings{DBLP:conf/dlt/1999,
  editor    = {Grzegorz Rozenberg and
               Wolfgang Thomas},
  title     = {Developments in Language Theory, Foundations, Applications, and
               Perspectives, Aachen, Germany, 6-9 July 1999},
  booktitle = {Developments in Language Theory},
  publisher = {World Scientific},
  year      = {2000},
  isbn      = {981-02-4380-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

Arturo Carpi, Aldo de Luca, Stefano Varricchio: Special factors in some combinational structures. 3-13 BibTeX
Julien Cassaigne: Subword complexity and periodicity in two or more dimensions. 14-21 BibTeX
Arto Salomaa, Sheng Yu: On the decomposition of finite languages. 22-31 BibTeX
Takashi Yokomori: Computation = self-assembly + conformational change: toward new computing paradigms. 32-43 BibTeX

Contibuted Papers

I. Automata and Languages

Marie-Pierre Béal, Olivier Carton: Asynchronous sliding block maps. 47-59 BibTeX
Cristian Calude, Elena Calude: Bisimulations and behaviour of nondeterministic automata. 60-70 BibTeX
Petr Jiricka, Jaroslav Král: Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata. 71-80 BibTeX
Pavel Kveton, Václav Koubek: Functions preserving classes of languages. 81-102 BibTeX
Gundula Niemann, Friedrich Otto: Restarting automata, Church-Rosser languages, and representations of r.e. languages. 103-114 BibTeX
Martin Plátek: Weak cyclic forms of rw-automata. 115-124 BibTeX
Klaus Wich: Exponential ambiguity of context-free grammars. 125-138 BibTeX

II. Codes, Combinatorics of Words, and Algebraic Methods

Marcella Anselmo: A non-ambiguous language factorization problem. 141-152 BibTeX
Henning Fernau, Klaus Reinhardt, Ludwig Staiger: Decidability of code properties. 153-163 BibTeX
Juhani Karhumäki, Sabrina Mantaci: Defect theorems for trees. 164-177 BibTeX
Juhani Karhumäki, Wojciech Plandowski: On the complexity of computing the order of repetition of a string. 178-184 BibTeX
John Loftus, Jeffrey Shallit, Ming-wei Wang: New problems of pattern avoidance. 185-199 BibTeX
Luis-Miguel Lopez, Philippe Narbel: Substitutions from Rauzy induction (extended abstract). 200-209 BibTeX
Ján Manuch: Characterization of a word by its subwords. 210-219 BibTeX
Ion Petre: On semilinearity in formal power series. 220-231 BibTeX
José Ruiz, Pedro García: Right and left strongly locally testable semigroups and languages. 232-241 BibTeX

III. Applications in Data Base Theory and Parsing

Yves Andre, Francis Bossut, Anne-Cécile Caron: On decidability of boundedness property for regular path queries. 245-256 BibTeX
Stefan Andrei, Manfred Kudlek: Bidirectional parsing for linear languages. 257-269 BibTeX
Anne Brüggemann-Klein, Derick Wood: Caterpillars, context, tree automata and tree pattern matching. 270-285 BibTeX
Nils Klarlund, Niels Damgaard, Michael I. Schwartzbach: Yakyak: parsing with logical side constraints. 286-301 BibTeX

IV. Generalized Models of Grammars and Computation

Henning Bordihn, Markus Holzer: Cooperating distributed grammar systems with non-terminating components. 305-315 BibTeX
Thomas Buchholz, Andreas Klein, Martin Kutrib: On tally languages and generalized interacting automata. 316-325 BibTeX
Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski: Table-driven and context-sensitive collage languages. 326-337 BibTeX
Rudolf Freund, Franziska Freund: Test tube systems: when two tubes are enough. 338-350 BibTeX
Markus Holzer: On fixed and general membership for external and internal contextual languages. 351-361 BibTeX
Carlos Martín-Vide, Alexandru Mateescu: Contextual grammars with trajectories. 362-374 BibTeX
Ralf Stiebe: Slender matrix languages. 375-385 BibTeX