DLT2020

Accepted Papers

  • Amazigh Amrane and Nicolas Bedon. Equational Theories of Scattered and Countable Series-parallel Posets
  • Laura Barker, Pamela Fleischmann, Katharina Harwardt, Florin Manea and Dirk Nowotka. Scattered Factor-Universality of Words
  • Collin Bleak. On normalish subgroups of the R. Thompson's groups
  • Hyunjoon Cheon and Yo-Sub Han. Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
  • Fabienne Chouraqui. An approach to the Herzog-Schonheim conjecture using automata
  • Mateus De Oliveira Oliveira and Michael Wehar. On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection
  • Lukas Fleischer and Jeffrey Shallit. The State Complexity of Lexicographically Smallest Words and Computing Successors
  • Pamela Fleischmann, Marie Lejeune, Florin Manea, Dirk Nowotka and Michel Rigo. Reconstructing Words from Right-Bounded-Block Words
  • Edwin Hamel-de le Court, Pascal Caron and Jean-Gabriel Luque. Trivial modifiers
  • Michal Hospodár and Peter Mlynárčik. Operations on Permutation Automata
  • Oscar Ibarra, Jozef Jirasek, Ian McQuillan and Luca Prigioniero. Space Complexity of Stack Automata Models
  • Lila Kari and Timothy Ng. Descriptional Complexity of Semi-Simple Splicing Systems
  • Florent Koechlin, Cyril Nicaud and Pablo Rotondo. On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
  • Johan Kopra. Dynamics of cellular automata on beta-shifts and direct topological factorizations
  • Florian Lietard and Matthieu Rosenfeld. Avoidability of Additive Cubes over Alphabets of Four Numbers
  • Raphaela Löbel, Michael Luttenberger and Helmut Seidl. Equivalence of Linear Tree Transducers with Output in the Free Group
  • Raphaela Löbel, Michael Luttenberger and Helmut Seidl. On the Balancedness of Tree-to-word Transducers
  • Andreas Maletti and Kevin Stier. On Tree Substitution Grammars
  • Augusto Modanese. Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
  • Daniel Průša and Michael Wehar. Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
  • Eric Rowland and Manon Stipulanti. Avoiding 5/4-powers on the alphabet of nonnegative integers (extended abstract)
  • Josef Rukavicka. Transition Property for $\alpha$-Power Free Languages with $\alpha\geq 2$ and $k\geq 3$ Letters
  • Ryoma Sin'Ya. Context-Freeness of Word-MIX Languages
  • Lama Tarsissi and Andrea Frosini. The characterization of the minimal paths in the Christoffel tree according to a second-order balancedness