NCMA 2017 - 9th Workshop on Non-Classical Models of Automata and ApplicationsAugust 17-18, 2017, Prague, Czech Republic |
Accepted papers
Regular (full) papersMINIMALITY PROBLEMS FOR PROMISE VERSIONS OF FINITE AUTOMATA by Michal Ajdarów
INHABITATION MACHINES: DETERMINISM AND PRINCIPALITY by Sandra Alves and Sabine Broda
AN EXTENSION OF THE LR PARSING ALGORITHM FOR TWO-HEAD PUSHDOWN AUTOMATA by Dávid Angyal and Benedek Nagy
STATE COMPLEXITY OF DISTINGUISHABILITY COMBINED WITH BOOLEAN OPERATIONS by Cezar Campeanu
SELF-VERIFYING PUSHDOWN AUTOMATA by Henning Fernau, Martin Kutrib and Matthias Wendlandt
STAR-COMPLEMENT-STAR AND KURATOWSKI ALGEBRAS ON PREFIX-FREE LANGUAGES by Galina Jirásková and Matú Palmovský
DECIDABILITY QUESTIONS FOR INSERTION SYSTEMS by Andreas Malcher
ON SHRINKING RESTARTING AUTOMATA by Friedrich Otto
TWO-SIDED STRICTLY LOCALLY TESTABLE LANGUAGES by Friedrich Otto, Markus Holzer and Martin Kutrib
REGULAR GRAMMARS FOR ARRAY LANGUAGES by Meenakshi Paramasivan, Henning Fernau and Gnanaraj Thomas Durairaj
NON-SELF-EMBEDDING GRAMMARS AND DESCRIPTIONAL COMPLEXITY by Giovanni Pighizzini and Luca Prigioniero
ANALYSIS BY REDUCTION OF ANALYTICAL PDT-TREES by Martin Plátek, Karel Oliva and Dana Pardubská
A RECURSIVE DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY by Tomoyuki Yamakami.
ON THE EXPRESSIVE POWER OF WEIGHTED RESTARTING AUTOMATA by Qichao Wang
Short papers
P SYSTEMS WITH COSTS AND THEIR RELATION TO PRICED TIME AUTOMATA AND PRICED TIME PETRI NETS by Bogdan Aman, Péter Battyányi, Gabriel Ciobanu, and György Vaszil
A NOVEL STREAM CIPHER BASED ON DETERMINISTIC FINITE AUTOMATON by Pál Dömösi and Géza Horváth
VARIANTS OF P COLONY AUTOMATA by Kristóf Kántor and György Vaszil
QUANTUM AUTOMATA FOR ONLINE MINIMIZATION PROBLEMS by Kamil Khadiev and Aliya Khadieva
MEMBERSHIP PROBLEM FOR TWO-DIMENSIONAL JUMPING FINITE AUTOMATA by Grzegorz Madejski and Andrzej Szepietowski
|
