Developments in Language Theory C

40 papers

YearTitle / Authors
20133-Abelian Cubes Are Avoidable on Binary Alphabets.
Robert Mercas, Aleksi Saarela
2013A Coloring Problem for Sturmian and Episturmian Words.
Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni
2013A Fresh Approach to Learning Register Automata.
Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
2013Abelian Repetitions in Sturmian Words.
Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston
2013Adjacent Ordered Multi-Pushdown Systems.
Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan
2013Alternative Automata Characterization of Piecewise Testable Languages.
Ondrej Klíma, Libor Polák
2013An Explicit Formula for the Intersection of Two Polynomials of Regular Languages.
Jean-Éric Pin
2013Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata.
Sven De Felice, Cyril Nicaud
2013Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers.
Zoltán Fülöp, Andreas Maletti
2013Cuts in Regular Expressions.
Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce W. Watson
2013Deciding Determinism of Unary Languages Is coNP-Complete.
Ping Lu, Feifei Peng, Haiming Chen
2013Developments in Language Theory - 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings
Marie-Pierre Béal, Olivier Carton
2013Extremal Words in the Shift Orbit Closure of a Morphic Sequence.
James D. Currie, Narad Rampersad, Kalle Saari
2013Factorizations and Universal Automaton of Omega Languages.
Vincent Carnino, Sylvain Lombardy
2013Finite Automata with Advice Tapes.
Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz
2013Inner Palindromic Closure.
Jürgen Dassow, Florin Manea, Robert Mercas, Mike Müller
2013Joint Spectral Characteristics: A Tale of Three Disciplines.
Raphaël M. Jungers
2013Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth.
Arseny M. Shur
2013New Results on Deterministic Sgraffito Automata.
Daniel Prusa, Frantisek Mráz, Friedrich Otto
2013On the Asymptotic Abelian Complexity of Morphic Words.
Francine Blanchet-Sadri, Nathan Fox
2013On the Dual Post Correspondence Problem.
Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
2013On the Number of Abelian Bordered Words.
Narad Rampersad, Michel Rigo, Pavel Salimov
2013One-Way Multi-Head Finite Automata with Pebbles But No States.
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2013Operational Characterization of Scattered MCFLs.
Zoltán Ésik, Szabolcs Iván
2013Operator Precedence ω-Languages.
Federica Panella, Matteo Pradella, Violetta Lonati, Dino Mandrioli
2013Proof of a Phase Transition in Probabilistic Cellular Automata.
Damien Regnault
2013Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem.
Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro
2013Recompression: Word Equations and Beyond.
Artur Jez
2013Regular Expressions with Binding over Data Words for Querying Graph Databases.
Leonid Libkin, Tony Tan, Domagoj Vrgoc
2013Repetition Avoidance in Circular Factors.
Hamoon Mousavi, Jeffrey O. Shallit
2013Some Decision Questions Concerning the Time Complexity of Language Acceptors.
Oscar H. Ibarra, Bala Ravikumar
2013Strict Bounds for Pattern Avoidance.
Francine Blanchet-Sadri, Brent Woodhouse
2013Subword Complexity and k-Synchronization.
Daniel Goc, Luke Schaeffer, Jeffrey O. Shallit
2013Suffixes, Conjugates and Lyndon Words.
Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino
2013The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages.
Manfred Droste, Heiko Vogler
2013Two Dimensional Prefix Codes of Pictures.
Marcella Anselmo, Dora Giammarresi, Maria Madonia
2013Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure.
Victor Marsault, Jacques Sakarovitch
2013Ultrametric Finite Automata and Turing Machines.
Rusins Freivalds
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet.
Artur Jez, Alexander Okhotin
2013Unambiguous Finite Automata.
Christof Löding