Accepted Papers

  • Adiga, A. and Kuhlman, C. and Marathe, M. and Ravi, S. S. and Rosenkrantz, D.J. and Stearns, R.E. Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems
  • Borsotti, A. and Breveglieri, L. and Crespi Reghizzi, S. and Morzenti, A. From Ambiguous Regular Expressions to Deterministic Parsing Automata
  • Broda, S. and Cavadas, S. and Ferreira, M. and Moreira, N. Deciding Synchronous Kleene Algebra with Derivatives
  • Caron, P. and Mignot, L. and Miklarz, C. On the Hierarchy of Block Deterministic Languages
  • Dang, Z. and Dementyev, D. and Fischer T.R. and Hutton W. Security of Numerical Sensors in Automata
  • Fernau, H. and Paramasivan, M. and Schmid, M.L. Jumping Finite Automata: Characterizations and Complexity
  • Giaquinta, E. Run-Length Encoded Nondeterministic KMP and Suffix Automata
  • Gruber, H. and Holzer, M. and Jakobi, S. More on Deterministic and Nondeterministic Finite Cover Automata
  • Gusev, V. and Szykuła, M. On the Number of Synchronizing Colorings of Digraphs
  • Heam, P.-C. and Joly, J.-L. On the Uniform Random Generation of Non deterministic Automata up to Isomorphism
  • Heam, P.-C. and Joly, J.-L. Random Generation and Enumeration of Accessible Deterministic Real-time Pushdown Automata
  • Hoffmann, S. and Staiger, L. Subword Metrics for Infinite Words
  • Hulden, M. From Two-Way to One-Way Finite Automata
  • Kushik, N. and Yevtushenko, N. Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata
  • Kutrib, M. and Wendlandt, M. Expressive Capacity of Concatenation Freeness
  • Madejski, G. Complexity of Membership Problem for Linear and Regular Permutation Languages
  • Merwe, B.v.d. and Berglund, M. On the Semantics of Regular Expression Parsing In the Wild
  • Mohri, M. and Riley, M. On the Disambiguation of Weighted Automata
  • Nakanishi, M. and Yakaryilmaz, A. Classical and Quantum Counter Automata on Promise Problems
  • Ng, T. and Rappaport, D. and Salomaa, K. State Complexity of Prefix Distance
  • Prusa, D. Decidability of the Emptiness Problem for Multi-dimensional Context-free Grammars
  • Szykuła, M. Checking whether an Automaton is Monotonic is NP-complete