default search action
11th NCMA 2019: Valencia, Spain
- Rudolf Freund, Markus Holzer, José M. Sempere:
Eleventh Workshop on Non-Classical Models of Automata and Applications, NCMA 2019, Valencia, Spain, July 2-3, 2019. Österreichische Computer Gesellschaft 2019, ISBN 978-3-903035-25-6
Invited Papers
- Victor Mitrana:
DNA self-assembly by hairpin (extended abstract). NCMA 2019: 11-24 - Agustín Riscos-Núñez:
Complexity classes in membrane computing: P-conjecture and related issues. NCMA 2019: 25-30
Regular Contributions
- Artiom Alhazov, Rudolf Freund, Sergiu Ivanov:
Register machines over groups. NCMA 2019: 31-46 - Samira Attou, Ludovic Mignot, Djelloul Ziadi:
Extended tree expressions and their derivatives. NCMA 2019: 47-62 - Jens Bruchertseifer, Henning Fernau:
Synchronizing series-parallel automata with loops. NCMA 2019: 63-78 - Rudolf Freund, Ludwig Staiger:
Turing machines with activations of transitions. NCMA 2019: 79-91 - Markus Holzer, Sebastian Jakobi:
A comment on strong language families and self-verifying complexity classes. NCMA 2019: 93-108 - Martin Kutrib, Andreas Malcher:
Digging input-driven pushdown automata. NCMA 2019: 109-124 - Peter Leupold:
Computing by observing reductions in partial orders. NCMA 2019: 125-138 - Frantisek Mráz, Friedrich Otto:
Window size two suffices for deterministic monotone RWW-automata. NCMA 2019: 139-154 - Benedek Nagy, Zita Kovács:
On simple 5' → 3' sensing Watson-Crick finite-state transducers. NCMA 2019: 155-170 - Igor T. Podolak, Adam Roman, Arkadiusz Czekajski, Damian Lesniak, Bartosz Zielinski:
Variational auto-encoders for generating feature-preserving automata. NCMA 2019: 171-185 - Bianca Truthe:
Accepting networks of evolutionary processors with resources restricted filters. NCMA 2019: 187-202
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.