Accepted Papers

  • Andrei Asinowski, Axel Bacher, Cyril Banderier and Bernhard Gittenberger. Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects
  • Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin and Elizaveta Sazhneva. Formal Languages over GF(2)
  • Dmitry Berdinsky and Phongpitak Trakuldit. Measuring Closeness between Cayley Automatic Groups and Automatic Groups
  • Laura Bozzelli, Adriano Peron and Aniello Murano. Event-clock Nested Automata
  • Thomas Chatain, Maurice Comlan, David Delfieu, Loig Jezequel and Olivier H. Roux. Pomsets and Unfolding of Reset Petri Nets
  • Ferdinando Cicalese, Zsuzsanna Liptak and Massimiliano Rossi. Bubble-Flip - A New Generation Algorithm for Prefix Normal Words
  • Murray Elder and Yoong Kuan Goh. Permutations Sorted by a Finite and an Infinite Stack in Series
  • Johannes K. Fichte, Markus Hecher and Irina Schindler. Default Logic and Bounded Treewidth
  • Stefan Gerdjikov. A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers
  • Demen Güler, Andreas Krebs, Klaus-Joern Lange and Petra Wolf. Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy
  • Sanjay Jain, Eric Martin and Frank Stephan. Transduced Learners
  • Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. On Periodicity Lemma for Partial Words
  • J. Andres Montoya and Christian Nolasco. On the Synchronization of Planar Automata
  • Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim Guldstrand Larsen and Radu Mardare. Timed Comparisons of Semi-Markov Processes
  • Markus Saers and Dekai Wu. Handling Ties Correctly and Efficiently in Viterbi Training Using the Viterbi Semiring
  • Uli Schlachter. Over-approximative Petri Net Synthesis for Restricted Subclasses of Nets
  • Rick Smetsers, Paul Fiterau-Brostean and Frits Vaandrager. Model Learning as a Satisfiability Modulo Theories Problem
  • Christoph Teichmann, Antoine Venant and Alexander Koller. Efficient Translation with Linear Bimorphisms
  • Maris Valdats. Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
  • Alexey Zhirabok and Alexey Shumsky. Disturbance Decoupling in Finite Automata