12. DLT 2008:
Kyoto,
Japan
Masami Ito, Masafumi Toyama (Eds.):
Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings.
Lecture Notes in Computer Science 5257 Springer 2008, ISBN 978-3-540-85779-2 BibTeX
Invited Talks
Contributed Papers
- Anil Ada:
On the Non-deterministic Communication Complexity of Regular Languages.
96-107
Electronic Edition (link) BibTeX
- Cyril Allauzen, Mehryar Mohri, Ashish Rastogi:
General Algorithms for Testing the Ambiguity of Finite Automata.
108-120
Electronic Edition (link) BibTeX
- Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl:
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.
121-133
Electronic Edition (link) BibTeX
- Frédérique Bassino, Laura Giambruno, Cyril Nicaud:
The Average State Complexity of the Star of a Finite Set of Words Is Linear.
134-145
Electronic Edition (link) BibTeX
- Henning Bordihn, Martin Kutrib, Andreas Malcher:
On the Computational Capacity of Parallel Communicating Finite Automata.
146-157
Electronic Edition (link) BibTeX
- Michelangelo Bucci, Aldo de Luca, Alessandro De Luca:
On a Generalization of Standard Episturmian Morphisms.
158-169
Electronic Edition (link) BibTeX
- Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan:
Universal Recursively Enumerable Sets of Strings.
170-182
Electronic Edition (link) BibTeX
- Cristian S. Calude, Marius Zimand:
Algorithmically Independent Sequences.
183-195
Electronic Edition (link) BibTeX
- Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni:
Relationally Periodic Sequences and Subword Complexity.
196-205
Electronic Edition (link) BibTeX
- Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera:
Bounds on Powers in Strings.
206-215
Electronic Edition (link) BibTeX
- Barbara F. Csima, Bakhadyr Khoussainov:
When Is Reachability Intrinsically Decidable?.
216-227
Electronic Edition (link) BibTeX
- Erzsébet Csuhaj-Varjú, Jürgen Dassow, György Vaszil:
Some New Modes of Competence-Based Derivations in CD Grammar Systems.
228-239
Electronic Edition (link) BibTeX
- Arturo Carpi, Flavio D'Alessandro:
The Synchronization Problem for Strongly Transitive Automata.
240-251
Electronic Edition (link) BibTeX
- Rodrigo de Souza:
On the Decidability of the Equivalence for k-Valued Transducers.
252-263
Electronic Edition (link) BibTeX
- Alberto Dennunzio, Enrico Formenti:
Decidable Properties of 2D Cellular Automata.
264-275
Electronic Edition (link) BibTeX
- Bruno Durand, Andrei E. Romashchenko, Alexander Shen:
Fixed Point and Aperiodic Tilings.
276-288
Electronic Edition (link) BibTeX
- Joost Engelfriet, Eric Lilin, Andreas Maletti:
Extended Multi Bottom-Up Tree Transducers.
289-300
Electronic Edition (link) BibTeX
- Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Derivation Tree Analysis for Accelerated Fixed-Point Computation.
301-313
Electronic Edition (link) BibTeX
- Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison:
Tree Automata with Global Constraints.
314-326
Electronic Edition (link) BibTeX
- Dominik D. Freydenberger, Daniel Reidenbach:
Bad News on Decision Problems for Patterns.
327-338
Electronic Edition (link) BibTeX
- Pawel Gawrychowski, Dalia Krieger, Narad Rampersad, Jeffrey Shallit:
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time.
339-358
Electronic Edition (link) BibTeX
- Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
More Concise Representation of Regular Languages by Automata and Regular Expressions.
359-370
Electronic Edition (link) BibTeX
- Jens Glöckler:
A Taxonomy of Deterministic Forgetting Automata.
371-382
Electronic Edition (link) BibTeX
- Hermann Gruber, Markus Holzer:
Provably Shorter Regular Expressions from Deterministic Finite Automata.
383-395
Electronic Edition (link) BibTeX
- Jana Hadravová, Stepan Holub:
Large Simple Binary Equality Words.
396-407
Electronic Edition (link) BibTeX
- Stepan Holub, Dirk Nowotka:
On the Relation between Periodicity and Unbordered Factors of Finite Words.
408-418
Electronic Edition (link) BibTeX
- Masami Ito, Lila Kari, Zachary Kincaid, Shinnosuke Seki:
Duplication in DNA Sequences.
419-430
Electronic Edition (link) BibTeX
- Galina Jirásková:
On the State Complexity of Complements, Stars, and Reversals of Regular Languages.
431-442
Electronic Edition (link) BibTeX
- Galina Jirásková, Alexander Okhotin:
On the State Complexity of Operations on Two-Way Finite Automata.
443-454
Electronic Edition (link) BibTeX
- Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
On the Size Complexity of Rotating and Sweeping Automata.
455-466
Electronic Edition (link) BibTeX
- Juhani Karhumäki, Aleksi Saarela:
An Analysis and a Reproof of Hmelevskii's Theorem.
467-478
Electronic Edition (link) BibTeX
- Ondrej Klíma, Libor Polák:
Hierarchies of Piecewise Testable Languages.
479-490
Electronic Edition (link) BibTeX
- Dietrich Kuske, Ingmar Meinecke:
Construction of Tree Automata from Regular Expressions.
491-503
Electronic Edition (link) BibTeX
- Roberto Mantaci, Sabrina Mantaci, Antonio Restivo:
Balance Properties and Distribution of Squares in Circular Words.
504-515
Electronic Edition (link) BibTeX
- Rémi Morin:
MSO Logic for Unambiguous Shared-Memory Systems.
516-528
Electronic Edition (link) BibTeX
- Victor L. Selivanov, Klaus W. Wagner:
Complexity of Topological Properties of Regular omega-Languages.
529-542
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:07:11 2009
by Michael Ley (ley@uni-trier.de)
