Accepted Papers

 

  • ▸ Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon and Daniel Rubery. Closure and Nonclosure Properties of the Compressible and Rankable Sets
  • ▸ Amazigh Amrane and Nicolas Bedon. Logic and rational languages of scattered and countable series-parallel posets
  • ▸ Malek Anabtawi, Sabit Hassan, Christos Kapoutsis and Mohammad Zakzok. An Oracle Hierarchy for Small One-way Finite Automata
  • ▸ Marcella Anselmo, Maria Madonia and Carla Selmi. Toroidal Codes and Conjugate Pictures
  • ▸ Tim Becker and Klaus Sutner. Orbits of Abelian Automaton Groups
  • ▸ Alex Bishop and Murray Elder. Bounded Automata Groups Are co-ET0L
  • ▸ Iovka Boneva, Joachim Niehren and Momar Sakho. Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables
  • ▸ Emilie Charlier, Svetlana Puzynina and Elise Vandomme. Recurrence in Multidimensional Words
  • ▸ Christophe Cordero. A note with computer exploration of the triangle conjecture
  • ▸ Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara and Antonio E. Porreca. Decidability of Sensitivity and Equicontinuity for Linear Higher-order Cellular Automata
  • ▸ Jean-Philippe Dubernard, Giovanna Guaiana and Ludovic Mignot. Geometrical Closure of Binary V3/2 Languages
  • ▸ Ajay K. Eeralla, Serdar Erbatur, Andrew M. Marshall and Christophe Ringeissen. Rule-based Unification in Combined Theories and the Finite Variant Property
  • ▸ Berthold Hoffmann and Mark Minas. Generalized Predictive Shift-reduce Parsing for Hyperedge Replacement Graph Grammars
  • ▸ Markus Holzer and Michal Hospodár. The Range of State Complexities of Languages Resulting from the Cut Operation
  • ▸ Galina Jiraskova and Ondrej Klima. Deterministic Biautomata and Subclasses of Deterministic Linear Languages
  • ▸ Lila Kari and Timothy Ng. State Complexity of Pseudocatenation
  • ▸ Ondrej Klima and Libor Polak. On Varieties of Ordered Automata
  • ▸ Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen and Wiktor Zuba. Efficient Representation and Counting of Antipower Factors in Words
  • ▸ Hans-Joerg Kreowski, Sabine Kuske and Aaron Lye. Transformation of Petri Nets into Context-dependent Fusion Grammars
  • ▸ Alexis Linard, Colin de la Higuera and Frits Vaandrager. Learning Unions of k-Testable Languages
  • ▸ Kalpana Mahalingam and Palak Pandoh. On the maximum number of distinct palindromic sub-arrays
  • ▸ Klaus Meer and Ameen Naif. Real Periodic Automata over Infinite Words
  • ▸ Daniel Pade and Stephen Fenner. Complexity of (R,C)-crosswords
  • ▸ Paweł Parys. Extensions of the Caucal Hierarchy?
  • ▸ Wojciech Rytter and Wiktor Zuba. Syntactic View of Sigma-Tau Generation of Permutations
  • ▸ Andrew Ryzhikov and Clemens Mullner. Palindromic Subsequences in Finite Words
  • ▸ Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki. Generalized Register Context-free Grammars
  • ▸ Tomoyuki Yamakami. Non-Uniform State Complexity of Quantum Finite Automata and Quantum Polynomial-Time Logarithmic-Space Computation with Quantum Advice
  • ▸ Vladimir Zakharov. Equivalence Checking of Prefix-free Transducers and Deterministic Two-tape Automata
  • ▸ Ilya Zakirzyanov, Antonio Morgado, Alexey Ignatiev, Vladimir Ulyantsev and Joao Marques-Silva. Efficient Symmetry Breaking for SAT-based Minimum DFA Inference
  • ▸Ahad N. Zehmakan. Tight Bounds on the Minimum Size of a Dynamic Monopoly