DLT 2022

Accepted Papers

  • Florian Stober and Armin Weiss. The power word problem in graph products
  • Aistis Atminas and Vadim Lozin. Deciding atomicity of subword-closed languages
  • Olivier Carton. Preservation of normality by unambiguous transducers
  • Francesco Dolce and Pierre-Adrien Tahay. Column representation of Sturmian words in cellular automata
  • Michel Rigo, Manon Stipulanti and Markus Whiteland. Binomial complexities and Parikh-collinear morphisms
  • Ekaterina Shemetova, Alexander Okhotin and Semyon Grigorev. Rational index of languages with bounded dimension of parse trees
  • 脡milie Charlier, C茅lia Cisternino and Manon Stipulanti. A full characterization of Bertrand numeration systems
  • Jozef Jirasek and Ian McQuillan. Visit-bounded stack automata
  • Dora Bulgakova, Anna Frid and J茅r茅my Scanvic. Prefix palindromic length of the Sierpinski word
  • Elias Heikkil盲, Pyry Herva and Jarkko Kari. On perfect coverings of two-dimensional grids
  • Stefan Hoffmann. Automata-theoretical regularity characterizations for the Iterated shuffle on commutative regular languages
  • Szymon 艁opaciuk and Daniel Reidenbach. The Billaud conjecture for $|\Sigma| = 4$, and beyond
  • Andreas Maletti and Andreea-Teodora N谩sz. Weighted tree automata with constraints
  • Ondrej Klima and Jonatan Kolegar. Well quasi-orders arising from finite ordered semigroups
  • Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana and Marinella Sciortino. Logarithmic equal-letter runs for BWT of purely morphic words
  • Hyunjoon Cheon, Joonghyuk Hahn and Yo-Sub Han. On the decidability of infix inclusion problem
  • Tomoyuki Yamakami. Kolmogorov complexity criteria for advised deterministic pushdown automata
  • Giovanni Pighizzini, Luca Prigioniero and 艩imon S谩dovsk媒. Performing regular operations with 1-limited automata
  • Oscar Ibarra and Ian McQuillan. On the complexity of decision problems for counter machines with applications to coding theory
  • Zoran Sunic. On one-counter positive cones of free groups
  • Ryoma Sin'Ya. Measuring power of locally testable languages
  • C. Aiswarya, Sahil Mhaskar and M. Praveen. Checking regular invariance under tightly-controlled string modifications