default search action
3rd NCMA 2011: Milan, Italy
- Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano:
Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings. books@ocg.at 282, Austrian Computer Society 2011, ISBN 978-3-85403-282-3
Invited Papers
- Andris Ambainis:
Quantum Finite Automata. NCMA 2011: 9-13 - Viliam Geffert:
An Alternating Hierarchy for Finite Automata. NCMA 2011: 15-36
Regular Contributions
- Ulrich Ultes-Nitsche, Joël Allred:
k-Counting Automata. NCMA 2011: 37-50 - Miklós Bartha, Miklós Krész:
Molecular Switching by Turing Automata. NCMA 2011: 51-71 - Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro:
Regularity of Languages Defined by Formal Series with Isolated Cut Point. NCMA 2011: 73-87 - Maria Paola Bianchi, Giovanni Pighizzini:
Normal Forms for Unary Probabilistic Automata. NCMA 2011: 89-102 - Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
On the Expressiveness of Parikh Automata and Related Models. NCMA 2011: 103-119 - Jürgen Dassow, Florin Manea, Bianca Truthe:
Generating Networks of Splicing Processors. NCMA 2011: 121-136 - Manfred Droste, Ingmar Meinecke, Branimir Seselja, Andreja Tepavcevic:
A Cascade Decomposition of Weighted Finite Transition Systems. NCMA 2011: 137-152 - Ondrej Klíma, Libor Polák:
On Biautomata. NCMA 2011: 153-164 - Richard Královic:
On the Power of Randomization for One-Way Finite Automata. NCMA 2011: 165-177 - Martin Kutrib, Matthias Wendlandt:
String Assembling Systems. NCMA 2011: 179-192 - Benedek Nagy, Friedrich Otto, Marcel Vollweiler:
Pushdown Automata with Translucent Pushdown Symbols. NCMA 2011: 193-208 - Abuzer Yakaryilmaz:
Superiority of One-Way and Realtime Quantum Machines and New Directions. NCMA 2011: 209-224
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.