http://www.mff.cuni.cz/fakulta/symboly/logotyp_fakulty_rgb2.png

NCMA 2017 - 9th Workshop on Non-Classical Models of Automata and Applications

                         August 17-18, 2017, Prague, Czech Republic

Program of the workshop

 

PDF version including session chairs.

 

Wednesday, August 16

 

 

 

 

 

Thursday, August 17

 

8:15

8:55

 

Registration

8:55

9:00

 

Opening

9:00

10:00

 

Jiří Wiedermann and Jan van Leeuwen: NON-CLASSICAL TURING MACHINES: EXTENDING THE NOTION OF COMPUTATION (invited lecture)

10:00

10:30

 

Coffee break

10:30

11:00

 

Markus Holzer, Martin Kutrib and Friedrich Otto: TWO-SIDED STRICTLY LOCALLY TESTABLE LANGUAGES

11:00

11:30

 

Andreas Malcher: DECIDABILITY QUESTIONS FOR INSERTION SYSTEMS

11:30

11:45

 

Grzegorz Madejski and Andrzej Szepietowski: MEMBERSHIP PROBLEM FOR TWO-DIMENSIONAL JUMPING FINITE AUTOMATA

11:45

13:00

 

Lunch

13:00

13:30

 

Friedrich Otto: ON SHRINKING RESTARTING AUTOMATA

13:30

14:00

 

Qichao Wang: ON THE EXPRESSIVE POWER OF WEIGHTED RESTARTING AUTOMATA

14:00

14:30

 

Martin Plátek, Karel Oliva and Dana Pardubská: ANALYSIS BY REDUCTION OF ANALYTICAL PDT-TREES

14:30

15:00

 

Coffee break

15:00

15:30

 

Giovanni Pighizzini and Luca Prigioniero: NON-SELF-EMBEDDING GRAMMARS AND DESCRIPTIONAL COMPLEXITY

15:30

16:00

 

Henning Fernau, Meenakshi Paramasivan and D. Gnanaraj Thomas: REGULAR GRAMMARS FOR ARRAY LANGUAGES

16:00

16:30

 

Sandra Alves and Sabine Broda: INHABITATION MACHINES: DETERMINISM AND PRINCIPALITY

16:30

16:45

 

Break

16:45

17:15

 

Michal Ajdarów: MINIMALITY PROBLEMS FOR PROMISE VERSIONS OF FINITE AUTOMATA

17:15

17:45

 

Tomoyuki Yamakami: A RECURSIVE DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY

17:45

18:00

 

Kamil Khadiev and Aliya Khadieva: QUANTUM AUTOMATA FOR ONLINE MINIMIZATION PROBLEMS

 

 

 

 

 

19:30

 

 

 

Workshop dinner at Profesní dům, Malostranské náměstí 25, map

 

 

Friday, August 18

 

9:00

10:00

 

Bianca Truthe: HIERARCHIES OF LANGUAGE FAMILIES OF CONTEXTUAL GRAMMARS (invited lecture)

10:00

10:30

 

Coffee break

10:30

11:00

 

Galina Jirásková and Matúš Palmovský: STAR-COMPLEMENT-STAR AND KURATOWSKI ALGEBRAS ON PREFIX-FREE LANGUAGES

11:00

11:30

 

Cezar Câmpeanu: STATE COMPLEXITY OF DISTINGUISHABILITY COMBINED WITH BOOLEAN OPERATIONS

11:30

11:45

 

Pál Dömösi and Géza Horváth: A NOVEL STREAM CIPHER BASED ON DETERMINISTIC FINITE AUTOMATON

11:45

13:00

 

Lunch

13:00

13:30

 

Henning Fernau, Martin Kutrib and Matthias Wendlandt: SELF-VERIFYING PUSHDOWN AUTOMATA

13:30

14:00

 

Dávid Angyal and Benedek Nagy: AN EXTENSION OF THE LR PARSING ALGORITHM FOR TWO-HEAD PUSHDOWN AUTOMATA

14:00

14:15

 

Bogdan Aman, Péter Battyányi, Gabriel Ciobanu, and György Vaszil: Simulating membrane systems with costs and local time membrane systems with time Petri nets

14:15

14:30

 

Kristóf Kántor and György Vaszil: VARIANTS OF P COLONY AUTOMATA

14:30

14:45

 

Closing of NCMA 2017 with information on NCMA 2018

 

 

19:00

 

 

 

Informal “get together”, where: Klášterní šenk (Monastery Tavern), Markétská 28/1 (Břevnov Monastery), Praha 6 – Břevnov, tram 22, 25, stop “Břevnoský klášter”, map