5. NCMA 2013: Umeå, Sweden
Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto (Eds.): Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings. Österreichische Computer Gesellschaft 2013 books@ocg.at 294 ISBN 978-3-85403-294-6
Invited Papers
- Erzsébet Csuhaj-Varjú: P Automata: Automata-like constructs modeling complex natural systems. 13-30
- Alexander Okhotin, Kai Salomaa: Input-driven pushdown automata: nondeterminism and unambiguity. 31-33
Regular Contributions
- Mikhail Barash: Programming language specification by a grammar with contexts. 51-67
- Henrik Björklund, Petter Ericson: A note on the complexity of deterministic tree-walking transducers. 69-83
- Peter Cerno: Grammatical inference of lambda-confluent context rewriting systems. 85-100
- Rudolf Freund, Marion Oswald: Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness. 133-150
- Viliam Geffert, Alexander Okhotin: One-way simulation of two-way finite automata over small alphabets. 151-162
- Petr Hoffmann: Power of S-kR-RRWW-automata. 163-178
- Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt: Deterministic one-way Turing machines with sublinear space bounds. 195-208
- Bianca Truthe: Computationally complete chains of evolutionary processors with random context filters. 225-241
- Marcel Vollweiler: Asynchronous systems of parallel communicating finite automata. 243-257
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-16T203152 by the dblp team