default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th NCMA 2014: Kassel, Germany
- Suna Bensch, Rudolf Freund, Friedrich Otto:
Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28-29, 2014. Proceedings. books@ocg.at 304, Österreichische Computer Gesellschaft 2014, ISBN 978-3-85403-304-2
Invited Papers
- Peter Leupold:
Is computation observer-relative? NCMA 2014: 13-27 - Frantisek Mráz:
Limited restarting automata. NCMA 2014: 29-56
Regular Contributions
- Ivone Amorim, António Machiavelo, Rogério Reis:
Statistical study on the number of injective linear finite transducers. NCMA 2014: 57-72 - Michaël Cadilhac, Andreas Krebs, Pierre McKenzie:
Extremely uniform branching programs. NCMA 2014: 73-83 - Cezar Câmpeanu, Nelma Moreira, Rogério Reis:
The distinguishability operation on regular languages. NCMA 2014: 85-100 - H. Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt, A. C. Cem Say, Abuzer Yakaryilmaz:
Classical and quantum realtime alternating automata. NCMA 2014: 101-114 - Moritz Gobbert, Henning Fernau:
Latrunculi - on the complexity of Roman chess. NCMA 2014: 115-130 - Markus Holzer, Sebastian Jakobi, Matthias Wendlandt:
On the computational complexity of partial word automata problems. NCMA 2014: 131-146 - Lukás Krtek, Frantisek Mráz:
Two-dimensional limited context restarting automata. NCMA 2014: 147-162 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Reversible queue automata. NCMA 2014: 163-178 - Kenichi Morita:
Reversible Turing machines with a small number of states. NCMA 2014: 179-190 - Giovanni Pighizzini:
Strongly limited automata. NCMA 2014: 191-206 - Martin Plátek, Markéta Lopatková, Dana Pardubská:
On the complexity of reductions by restarting automata. NCMA 2014: 207-222 - Petr Sosík, Miroslav Langer:
Improved universality proof for catalytic P systems and a relation to non-semilinear sets. NCMA 2014: 223-233 - Bianca Truthe:
A relation between definite and ordered finite automata. NCMA 2014: 235-247 - Hiroaki Yamamoto:
A new finite automaton construction for regular expressions. NCMA 2014: 249-264
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-12-02 21:15 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:
