Accepted Papers
- Larbi Abdenebaoui, Hans-Jorg Kreowski and Sabine Kuske. GRAPH-TRANSFORMATIONAL SWARMS
- Mikhail Barash. PROGRAMMING LANGUAGE SPECIFICATION BY A GRAMMAR WITH CONTEXTS
- Henrik Bjorklund and Petter Ericson. A NOTE ON THE COMPLEXITY OF DETERMINISTIC TREE-WALKING TRANSDUCERS
- Peter Cerno. GRAMMATICAL INFERENCE OF LAMBDA-CONFLUENT CONTEXT REWRITING SYSTEMS
- Manfred Droste und Doreen Götze. THE SUPPORT OF NESTED WEIGHTED AUTOMATA
- Henning Fernau, Markus L. Schmid and K.G. Subramanian. TWO-DIMENSIONAL PATTERN LANGUAGES
- Rudolf Freund and Marion Oswald. CATALYTIC AND PURELY CATALYTIC P AUTOMATA: CONTROL MECHANISMS FOR OBTAINING COMPUTATIONAL COMPLETNESS
- Villiam Geffert and Alexander Okhotin. ONE-WAY SIMULATION OF TWO-WAY FINITE AUTOMATA OVER SMALL ALPHABETS
- Petr Hoffmann. POWER OF S-kR-RRWW-AUTOMATA.
- Markus Holzer and Sebastian Jakobi. MINIMIZATION AND CHARACTERIZATIONS FOR BIAUTOMATA
- Martin Kutrib, Julien Provillard, Gyorgy Vaszil and Matthias Wendlandt. DETERMINISTIC ONE-WAY TURING MACHINES WITH SUBLINEAR SPACE BOUNDS
- Giovanni Pighizzini and Andrea Pisoni. LIMITED AUTOMATA AND CONTEXT-FREE LANGUAGES
- Bianca Truthe. CHAINS OF EVOLUTIONARY PROCESSORS WITH RANDOM CONTEXT FILTERS
- Marcel Vollweiler. ASYNCHRONOUS SYSTEMS OF PARALLEL COMMUNICATING FINITE AUTOMATA
The camera-ready version up to 16 pages is due to July 21, 2013 (strict deadline) and must be prepared in the OCG-style.
The proceedings of NCMA 2013 will appear as a volume in the series books@ocg.at, and extended and carefully revised version of selected contributions will be published in a special issue of Fundamenta Informaticae.