default search action
NCMA 2024: Göttingen, Germany
- Florin Manea, Giovanni Pighizzini:
Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), NCMA 2024, Göttingen, Germany, 12-13 August 2024. EPTCS 407, 2024 - Yvo Ad Meeres:
A New Notion of Regularity: Finite State Automata Accepting Graphs. 5-26 - Patrik Adrián, György Vaszil:
A GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation. 27-43 - Henning Bordihn, Helena Schulz:
Determinism in Multi-Soliton Automata. 44-58 - Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis:
Operational State Complexity of Block Languages. 59-76 - Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail Volkov:
Winning Strategies for the Synchronization Game on Subclasses of Finite Automata. 77-85 - Martin Havel, Zbynek Krivka, Alexander Meduna:
How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars. 86-99 - Luisa Herrmann, Johannes Osterholzer:
Non-Global Parikh Tree Automata. 100-117 - Marvin Ködding, Bianca Truthe:
Various Types of Comet Languages and their Application in External Contextual Grammars. 118-135 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Complexity of Unary Exclusive Nondeterministic Finite Automata. 136-149 - Frantisek Mráz, Friedrich Otto:
Repetitive Finite Automata With Translucent Letters. 150-167 - Benedek Nagy:
5' -> 3' Watson-Crick Automata accepting Necklaces. 168-185 - Vladimir Podolskii, Victor Selivanov:
Complexity Aspects of the Extension of Wagner's Hierarchy to k-Partitions. 186-197 - Jirí Wiedermann, Jan van Leeuwen:
Large Language Models and the Extended Church-Turing Thesis. 198-213
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.