8:00 - ... |
Registration |
8:50 - 9:00 |
Opening of NCMA 2013 |
9:00 - 10:00 |
Invited talk. Erzsebet Csuhaj Varju. P Automata: Automata-like Constructs Modeling Complex Natural Systems |
10:00 - 10:30 |
Coffee break |
10:30 - 11:00 |
Peter Cerno. Grammatical inference of lambda-confluent context rewriting systems. |
11:00 - 11:30 |
Martin Kutrib, Julien Provillard, Gyorgy Vaszil and Matthias Wendlandt. Deterministic one-way turing machines with sublinear space bounds.
|
11:30 - 12:00 |
Giovanni Pighizzini and Andrea Pisoni. Limited automata and context-free languages. |
12:00 - 13:00 |
Lunch break |
13:00 - 13:30 |
Biance Truthe. Chains of evolutionary processors with random context filters. |
13:30 - 14:00 |
Rudolf Freund and Marion Oswald. Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completness.
|
14:00 - 14:30 |
Marcel Vollweiler. Asynchronous systems of parallel communicating finite automata. |
14:30 - 15:00 |
Petr Hoffmann. Power of S-kR-RRWW-automata. |
15:00 - 15:30 |
Coffee break |
15:30 - 16:00 |
Villiam Geffert and Alexander Okhotin. One-way simulation of two-way finite automata over small alphabets. |
16:00 - 16:30 |
Manfred Droste and Doreen Götze. The support of nested weighted automata. |
16:30 - 17:00 |
Henrik Bjorklund and Petter Ericson. A note on the complextiy of deterministic tree-walking transducers. |
17:00 - 17:30 |
Larbi Abdenebaoui, Hans-Jorg Kreowski and Sabine Kuske. Graph-transformational swarms. |
19:00 |
Workshop dinner |