default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th DLT 1999: Aachen, Germany
- Grzegorz Rozenberg, Wolfgang Thomas:
Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999. World Scientific 2000, ISBN 981-02-4380-4
Invited Lectures
- Arturo Carpi, Aldo de Luca, Stefano Varricchio:
Special factors in some combinational structures. 3-13 - Julien Cassaigne:
Subword complexity and periodicity in two or more dimensions. 14-21 - Arto Salomaa, Sheng Yu:
On the decomposition of finite languages. 22-31 - Takashi Yokomori:
Computation = self-assembly + conformational change: toward new computing paradigms. 32-43
Contibuted Papers
I. Automata and Languages
- Marie-Pierre Béal, Olivier Carton
:
Asynchronous sliding block maps. 47-59 - Cristian Calude, Elena Calude:
Bisimulations and behaviour of nondeterministic automata. 60-70 - Petr Jiricka, Jaroslav Král:
Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata. 71-80 - Pavel Kveton, Václav Koubek:
Functions preserving classes of languages. 81-102 - Gundula Niemann, Friedrich Otto:
Restarting automata, Church-Rosser languages, and representations of r.e. languages. 103-114 - Martin Plátek:
Weak cyclic forms of rw-automata. 115-124 - Klaus Wich:
Exponential ambiguity of context-free grammars. 125-138
II. Codes, Combinatorics of Words, and Algebraic Methods
- Marcella Anselmo:
A non-ambiguous language factorization problem. 141-152 - Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. 153-163 - Juhani Karhumäki, Sabrina Mantaci:
Defect theorems for trees. 164-177 - Juhani Karhumäki, Wojciech Plandowski:
On the complexity of computing the order of repetition of a string. 178-184 - John Loftus, Jeffrey O. Shallit, Ming-wei Wang:
New problems of pattern avoidance. 185-199 - Luis-Miguel Lopez, Philippe Narbel:
Substitutions from Rauzy induction (extended abstract). 200-209 - Ján Manuch:
Characterization of a word by its subwords. 210-219 - Ion Petre:
On semilinearity in formal power series. 220-231 - José Ruiz, Pedro García:
Right and left strongly locally testable semigroups and languages. 232-241
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 - Stefan Andrei, Manfred Kudlek:
Bidirectional parsing for linear languages. 257-269 - Anne Brüggemann-Klein, Derick Wood:
Caterpillars, context, tree automata and tree pattern matching. 270-285 - Nils Klarlund, Niels Damgaard, Michael I. Schwartzbach:
Yakyak: parsing with logical side constraints. 286-301
IV. Generalized Models of Grammars and Computation
- Henning Bordihn, Markus Holzer:
Cooperating distributed grammar systems with non-terminating components. 305-315 - Thomas Buchholz, Andreas Klein, Martin Kutrib:
On tally languages and generalized interacting automata. 316-325 - Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski:
Table-driven and context-sensitive collage languages. 326-337 - Rudolf Freund, Franziska Freund:
Test tube systems: when two tubes are enough. 338-350 - Markus Holzer:
On fixed and general membership for external and internal contextual languages. 351-361 - Carlos Martín-Vide, Alexandru Mateescu:
Contextual grammars with trajectories. 362-374 - Ralf Stiebe:
Slender matrix languages. 375-385
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.
last updated on 2024-12-26 00:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
