Accepted Papers

  • The distinguishability operation on regular languages by Cezar Campeanu, Nelma Moreira, and Rogerio Reis
  • Statistical study on the number of injective linear finite transducers by Ivone Amorim, Antonio Machiavelo, and Rogerio Reis
  • Reversible Turing machines with a small number of states by Kenichi Morita
  • Improved universality proof of catalytic P systems and a relation to non-semilinear sets by Petr Sosik and Miroslav Langer
  • Strongly limited automata by Giovanni Pighizzini
  • On complexity of reductions by restarting automata by Martin Platek, Dana Pardubska, and Marketa Lopatkova
  • Reversible queue automata by Martin Kutrib, Andreas Malcher, and Matthias Wendlandt
  • A new finite automaton construction for regular expressions by Hiroaki Yamamoto
  • On the computational complexity of partial word automata problems by Markus Holzer, Sebastian Jakobi, and Matthias Wendlandt
  • A relation between definite and ordered finite automata by Bianca Truthe
  • Two-dimensional limited context restarting automata by Lukas Krtek and Frantisek Mraz
  • Extremely uniform branching programs by Michael Cadilhac, Andreas Krebs, and Pierre McKenzie
  • Latrunculi - On the complexity of Roman chess by Moritz Gobbert and Henning Fernau
  • Classical and quantum realtime alternating automata by H. Gokalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A.C. Cem Say, and Abuzer Yakaryilmaz

The camera-ready version of up to 16 pages is due until July 1, 2014 (strict deadline) and must be prepared in the OCG-style.

The proceedings of NCMA 2014 will appear as a volume in the series, and extended and carefully revised version of selected contributions will be published in a special issue of Fundamenta Informaticae.

Copyright @ by Markus Holzer. All rights reserved.