default search action
10th NCMA 2018: Košice, Slovakia
- Rudolf Freund, Michal Hospodár, Galina Jirásková, Giovanni Pighizzini:
Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018. Österreichische Computer Gesellschaft 2018, ISBN 978-3-903035-21-8
Invited Papers
- Bruno Guillon:
On nondeterministic two-way transducers. NCMA 2018: 11-27 - José M. Sempere:
On the application of Watson-Crick finite automata for the resolution of bioinformatic problems. NCMA 2018: 29-30
Regular Contributions
- Pablo Arrighi, Clément Chouteau, Stefano Facchini, Simon Martiel:
Causal dynamics of discrete manifolds. NCMA 2018: 31-47 - Martin Berglund, Frank Drewes, Brink van der Merwe:
On regular expressions with backreferences and transducers. NCMA 2018: 49-64 - Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Postselecting probabilistic finite state recognizers and verifiers. NCMA 2018: 65-81 - Markus Holzer, Martin Kutrib:
Automata that may change their mind. NCMA 2018: 83-98 - Ondrej Klíma, Libor Polák:
Forbidden patterns for ordered automata. NCMA 2018: 99-115 - Radim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna:
A jumping 5' → 3' Watson-Crick finite automata model. NCMA 2018: 117-132 - Martin Kutrib, Friedrich Otto:
Two-sided locally testable languages. NCMA 2018: 133-148 - Frantisek Mráz, Friedrich Otto, Martin Plátek:
Characterizations of LRR-languages by correctness-preserving computations. NCMA 2018: 149-164 - Bianca Truthe:
Networks of evolutionary processors with resources restricted filters. NCMA 2018: 165-180 - Qichao Wang, Yongming Li:
Jumping restarting automata. NCMA 2018: 181-196 - Tomoyuki Yamakami:
One-way topological automata and the tantalizing effects of their topological features. NCMA 2018: 197-214
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.