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
2018A Characterization of Completely Reachable Automata.Eugenija A. Bondar, Mikhail V. Volkov
2018Tree-to-Graph Transductions with Scope.Johanna Bjrklund
2018Additive Number Theory via Approximation by Regular Languages.Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit
2018Decidability of Right One-Way Jumping Finite Automata.Simon Beier, Markus Holzer
2018From Two-Way Transducers to Regular Function Expressions.Nicolas Baudru, Pierre-Alain Reynier
2018Weak Cost Register Automata Are Still Powerful.Shaull Almagor, Michal Cadilhac, Filip Mazowiecki, Guillermo A. Prez
2018Computational Complexity of Decision Problems on Self-verifying Finite Automata.Markus Holzer, Sebastian Jakobi, Jozef Jirsek Jr.
2017Classifying Non-periodic Sequences by Permutation Transducers.Hans Zantema, Wieb Bosma
2017One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report).Tomoyuki Yamakami
2017Connecting Decidability and Complexity for MSO Logic.Michal Skrzypczak
2017On the Number of Rich Words.Josef Rukavicka
2017On Computational Complexity of Set Automata.Alexander A. Rubtsov, Mikhail N. Vyalyi
2017Binomial Coefficients, Valuations, and Words.Eric Rowland
2017A Characterization of Infinite LSP Words.Gwnal Richomme
2017Limited Automata and Unary Languages.Giovanni Pighizzini, Luca Prigioniero
2017On the Tree of Binary Cube-Free Words.Elena A. Petrova, Arseny M. Shur
2017Deleting Deterministic Restarting Automata with Two Windows.Frantisek Mrz, Friedrich Otto
2017Two-Variable First Order Logic with Counting Quantifiers: Complexity Results.Kamal Lodaya, A. V. Sreejith
2017The Generalized Rank of Trace Languages.Michal Kunc, Jan Meitner
2017A Comprehensive Introduction to the Theory of Word-Representable Graphs.Sergey Kitaev
2017Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties.Oscar H. Ibarra, Ian McQuillan
2017Equivalence of Symbolic Tree Transducers.Vincent Hugot, Adrien Boiret, Joachim Niehren
2017On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$.Michal Hospodr, Galina Jirskov, Peter Mlynrcik
2017A Medvedev Characterization of Recognizable Tree Series.Luisa Herrmann
2017Differences Between 2D Neighborhoods According to Real Time Computation.Anal Grandjean
226250 of 1,061← PreviousNext →

Comparable venues

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