Skip to content

Developments in Language Theory

DLT

C

CORE rank

CORE rank (raw)

C

Fields of research

Theory of Computation

Papers indexed

1,061

1993–2026

Papers per year

199350 peak2026

DLT papers

1,061 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2014Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper).Anne Dicky, David Janin
2014Closure Properties of Pattern Languages.Joel D. Day, Daniel Reidenbach, Markus L. Schmid
2014Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.Janusz A. Brzozowski, Marek Szykula
2014On Two Algorithmic Problems about Synchronizing Automata - (Short Paper).Mikhail V. Berlinkov
2014On Automatic Transitive Graphs.Dmitry Berdinsky, Bakhadyr Khoussainov
2014Semisimple Synchronizing Automata and the Wedderburn-Artin Theory.Jorge Almeida, Emanuele Rodaro
2013Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth.Arseny M. Shur
2013Proof of a Phase Transition in Probabilistic Cellular Automata.Damien Regnault
2013On the Number of Abelian Bordered Words.Narad Rampersad, Michel Rigo, Pavel Salimov
2013New Results on Deterministic Sgraffito Automata.Daniel Prusa, Frantisek Mrz, Friedrich Otto
2013An Explicit Formula for the Intersection of Two Polynomials of Regular Languages.Jean-ric Pin
2013Operator Precedence ω-Languages.Federica Panella, Matteo Pradella, Violetta Lonati, Dino Mandrioli
2013Repetition Avoidance in Circular Factors.Hamoon Mousavi, Jeffrey O. Shallit
20133-Abelian Cubes Are Avoidable on Binary Alphabets.Robert Mercas, Aleksi Saarela
2013Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure.Victor Marsault, Jacques Sakarovitch
2013Deciding Determinism of Unary Languages Is coNP-Complete.Ping Lu, Feifei Peng, Haiming Chen
2013A Coloring Problem for Sturmian and Episturmian Words.Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni
2013Unambiguous Finite Automata.Christof Lding
2013Regular Expressions with Binding over Data Words for Querying Graph Databases.Leonid Libkin, Tony Tan, Domagoj Vrgoc
2013One-Way Multi-Head Finite Automata with Pebbles But No States.Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2013Finite Automata with Advice Tapes.Ugur Kk, A. C. Cem Say, Abuzer Yakaryilmaz
2013Alternative Automata Characterization of Piecewise Testable Languages.Ondrej Klma, Libor Polk
2013Joint Spectral Characteristics: A Tale of Three Disciplines.Raphal M. Jungers
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet.Artur Jez, Alexander Okhotin
2013Recompression: Word Equations and Beyond.Artur Jez
351375 of 1,061← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.