default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th DLT 2005: Palermo, Italy
- Clelia de Felice, Antonio Restivo:
Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings. Lecture Notes in Computer Science 3572, Springer 2005, ISBN 3-540-26546-5 - Jean-Paul Allouche
, Amir Sapir:
Restricted Towers of Hanoi and Morphisms. 1-10 - Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov:
Collapsing Words: A Progress Report. 11-21 - Tugkan Batu, Süleyman Cenk Sahinalp:
Locally Consistent Parsing and Applications to Approximate String Comparisons. 22-35 - Arturo Carpi, Aldo de Luca:
Central Sturmian Words: Recent Developments. 36-56 - Jarkko Kari:
Reversible Cellular Automata. 57-68 - Howard Straubing:
Inexpressibility Results for Regular Languages in Nonregular Settings. 69-77 - Farid M. Ablayev, Aida Gainutdinova:
Complexity of Quantum Uniform and Nonuniform Automata. 78-87 - Sergey A. Afonin, Elena Hazova:
Membership and Finiteness Problems for Rational Sets of Regular Languages. 88-99 - Artiom Alhazov, Rudolf Freund, Marion Oswald:
Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells. 100-111 - Dimitry S. Ananichev:
The Mortality Threshold for Partially Monotonic Automata. 112-121 - Isabel M. Araújo, Véronique Bruyère:
Sturmian Words: Dynamical Systems and Derivated Words. 122-133 - Nicolas Bedon, Chloe Rispal:
Schützenberger and Eilenberg Theorems for Words on Linear Orderings. 134-145 - Paul Bell, Igor Potapov:
On the Membership of Invertible Diagonal Matrices. 146-157 - Alexis Bès, Olivier Carton:
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. 158-167 - Henning Bordihn, Markus Holzer, Martin Kutrib:
Revolving-Input Finite Automata. 168-179 - Jean-Pierre Borel, Christophe Reutenauer:
Some New Results on Palindromic Factors of Billiard Words. 180-188 - Srecko Brlek, Gilbert Labelle, Annie Lacasse:
A Note on a Result of Daurat and Nivat. 189-198 - Aldo de Luca, Alessandro De Luca:
Palindromes in Sturmian Words. 199-208 - Avi Elkharrat, Christiane Frougny:
Voronoi Cells of Beta-Integers. 209-223 - Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi:
Languages with Mismatches and an Application to Approximate Indexing. 224-235 - Thomas Fernique:
Bidimensional Sturmian Sequences and Substitutions. 236-247 - Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider:
Unambiguous Morphic Images of Strings. 248-259 - Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
Complementing Two-Way Finite Automata. 260-271 - Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König:
On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. 272-283 - Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek:
Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. 284-295 - Lila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin:
On Hairpin-Free Words and Languages. 296-307 - Karianto Wong:
Adding Monotonic Counters to Automata and Transition Graphs. 308-319 - Juha Kortelainen:
Polynomial Generators of Recursively Enumerable Languages. 320-326 - Michal Kunc:
On Language Inequalities XK subset of LX. 327-337 - Andreas Maletti:
The Power of Tree Series Transducers of Type I and II. 338-349 - Paolo Massazza:
The Inclusion Problem for Unambiguous Rational Trace Languages. 350-361 - Alexander Okhotin:
LR Parsing for Boolean Grammars. 362-373 - Elena V. Pribavkina:
On Some Properties of the Language of 2-Collapsing Words. 374-384 - Lutz Priese:
Semi-rational Sets of DAGs. 385-396 - Kalle Saari:
On the Frequency of Letters in Pure Binary Morphic Sequences. 397-408
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 2025-03-29 00:05 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:
