default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th NCMA 2013: Umeå, Sweden
- Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto:
Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings. [email protected] 294, Österreichische Computer Gesellschaft 2013, ISBN 978-3-85403-294-6
Invited Papers
- Erzsébet Csuhaj-Varjú:
P Automata: Automata-like constructs modeling complex natural systems. NCMA 2013: 13-30 - Alexander Okhotin, Kai Salomaa:
Input-driven pushdown automata: nondeterminism and unambiguity. NCMA 2013: 31-33
Regular Contributions
- Larbi Abdenebaoui, Hans-Jörg Kreowski, Sabine Kuske:
Graph-transformational swarms. NCMA 2013: 35-50 - Mikhail Barash:
Programming language specification by a grammar with contexts. NCMA 2013: 51-67 - Henrik Björklund, Petter Ericson:
A note on the complexity of deterministic tree-walking transducers. NCMA 2013: 69-83 - Peter Cerno:
Grammatical inference of lambda-confluent context rewriting systems. NCMA 2013: 85-100 - Manfred Droste, Doreen Götze:
The support of nested weighted automata. NCMA 2013: 101-116 - Henning Fernau, Markus L. Schmid, K. G. Subramanian:
Two-dimensional pattern languages. NCMA 2013: 117-132 - Rudolf Freund, Marion Oswald:
Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness. NCMA 2013: 133-150 - Viliam Geffert, Alexander Okhotin:
One-way simulation of two-way finite automata over small alphabets. NCMA 2013: 151-162 - Petr Hoffmann:
Power of S-kR-RRWW-automata. NCMA 2013: 163-178 - Markus Holzer, Sebastian Jakobi:
Minimization and characterizations for biautomata. NCMA 2013: 179-193 - Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt:
Deterministic one-way Turing machines with sublinear space bounds. NCMA 2013: 195-208 - Giovanni Pighizzini, Andrea Pisoni:
Limited automata and context-free languages. NCMA 2013: 209-223 - Bianca Truthe:
Computationally complete chains of evolutionary processors with random context filters. NCMA 2013: 225-241 - Marcel Vollweiler:
Asynchronous systems of parallel communicating finite automata. NCMA 2013: 243-257
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
