default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th DLT 2013: Marne-la-Vallée, France
- Marie-Pierre Béal, Olivier Carton
:
Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings. Lecture Notes in Computer Science 7907, Springer 2013, ISBN 978-3-642-38770-8
Invited Talks
- Rusins Freivalds:
Ultrametric Finite Automata and Turing Machines. 1-11 - Artur Jez:
Recompression: Word Equations and Beyond. 12-26 - Raphaël M. Jungers:
Joint Spectral Characteristics: A Tale of Three Disciplines. 27-28 - Christof Löding:
Unambiguous Finite Automata. 29-30 - Jean-Éric Pin:
An Explicit Formula for the Intersection of Two Polynomials of Regular Languages. 31-45
Regular Papers
- Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Two Dimensional Prefix Codes of Pictures. 46-57 - Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan:
Adjacent Ordered Multi-Pushdown Systems. 58-69 - Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson:
Cuts in Regular Expressions. 70-81 - Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro:
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. 82-93 - Francine Blanchet-Sadri, Nathan Fox:
On the Asymptotic Abelian Complexity of Morphic Words. 94-105 - Francine Blanchet-Sadri, Brent Woodhouse:
Strict Bounds for Pattern Avoidance. 106-117 - Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege:
A Fresh Approach to Learning Register Automata. 118-130 - Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Suffixes, Conjugates and Lyndon Words. 131-142 - James D. Currie, Narad Rampersad, Kalle Saari:
Extremal Words in the Shift Orbit Closure of a Morphic Sequence. 143-154 - Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller:
Inner Palindromic Closure. 155-166 - Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
On the Dual Post Correspondence Problem. 167-178 - Sven De Felice, Cyril Nicaud:
Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata. 179-190 - Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni:
A Coloring Problem for Sturmian and Episturmian Words. 191-202 - Manfred Droste, Heiko Vogler:
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. 203-214 - Zoltán Ésik, Szabolcs Iván:
Operational Characterization of Scattered MCFLs. 215-226 - Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Repetitions in Sturmian Words. 227-238 - Zoltán Fülöp, Andreas Maletti:
Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers. 239-251 - Daniel Goc, Luke Schaeffer, Jeffrey O. Shallit:
Subword Complexity and k-Synchronization. 252-263 - Oscar H. Ibarra, Bala Ravikumar:
Some Decision Questions Concerning the Time Complexity of Language Acceptors. 264-276 - Artur Jez, Alexander Okhotin:
Unambiguous Conjunctive Grammars over a One-Letter Alphabet. 277-288 - Ondrej Klíma, Libor Polák:
Alternative Automata Characterization of Piecewise Testable Languages. 289-300 - Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz:
Finite Automata with Advice Tapes. 301-312 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
One-Way Multi-Head Finite Automata with Pebbles But No States. 313-324 - Leonid Libkin, Tony Tan, Domagoj Vrgoc:
Regular Expressions with Binding over Data Words for Querying Graph Databases. 325-337 - Vincent Carnino, Sylvain Lombardy:
Factorizations and Universal Automaton of Omega Languages. 338-349 - Ping Lu, Feifei Peng, Haiming Chen:
Deciding Determinism of Unary Languages Is coNP-Complete. 350-361 - Victor Marsault, Jacques Sakarovitch:
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure. 362-373 - Robert Mercas, Aleksi Saarela:
3-Abelian Cubes Are Avoidable on Binary Alphabets. 374-383 - Hamoon Mousavi, Jeffrey O. Shallit:
Repetition Avoidance in Circular Factors. 384-395 - Federica Panella, Matteo Pradella, Violetta Lonati, Dino Mandrioli:
Operator Precedence ω-Languages. 396-408 - Daniel Prusa, Frantisek Mráz, Friedrich Otto:
New Results on Deterministic Sgraffito Automata. 409-419 - Narad Rampersad, Michel Rigo, Pavel Salimov:
On the Number of Abelian Bordered Words. 420-432 - Damien Regnault:
Proof of a Phase Transition in Probabilistic Cellular Automata. 433-444 - Arseny M. Shur:
Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth. 445-457
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-12-02 23:31 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:
