12–13 Aug 2024
Alte Mensa
Europe/Berlin timezone

Scientific Programme

  • NCMA 2024

    Monday 12.8.2024

    9:00 - 9:20 Registration

    9:20 - 9:30 Opening

    9:30 - 11:00 NCMA Contributed Talks (3 talks, Chair: Tore Koß)
    - Friedrich Otto and František Mráz. Repetitive Finite Automata With Translucent Letters
    - Martin Kutrib, Andreas Malcher and Matthias Wendlandt. Complexity of Unary Exclusive Nondeterministic Finite Automata
    - Henning Bordihn and Helena Schulz. Determinism in Multi-Soliton Automata

    11:00 - 11:30 Coffee Break

    11:30 - 12:30 Invited Talk: Robert Mercas (Chair: Florin Manea)

    12:30 - 14:00 Lunch Break

    14:00 - 15:30 NCMA Contributed Talks (3 talks, Chair: Martin Kutrib)
    - Vladimir Podolskii and Victor Selivanov. Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions
    - Jiřī Wiedermann and Jan van Leeuwen. Large Language Models and the Extended Church-Turing Thesis
    - Marvin Ködding and Bianca Truthe. Various Types of Comet Languages and their Application in External Contextual Grammars

    15:30 - 16:00 Coffee break

    16:00 - 18:00 NCMA Contributed Talks (4 talks, Chair: Bianca Truthe)
    - Benedek Nagy. 5' -> 3' Watson-Crick Automata accepting Necklaces
    - Luisa Herrmann and Johannes Osterholzer. Non-Global Parikh Tree Automata
    - Martin Havel, Zbyněk Křivka and Alexander Meduna. How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
    - Yvo Ad Meeres. A New Notion of Regularity: Finite State Automata Accepting Graphs

    18:00 Business meeting

    19:00 Dinner
    - Kartoffelhaus, Goethe-Allee 8, 37073 Göttingen

    Tuesday 13.8.2024

    9:30 - 11:00 NCMA Contributed Talks (3 talks, Chair: Stefan Siemer)
    - Guilherme Duarte, Nelma Moreira, Luca Prigioniero and Rogério Reis. Operational State Complexity of Block Languages
    - Henning Fernau, Carolina Haase, Stefan Hoffmann and Mikhail Volkov. Winning strategies for the synchronization game on subclasses of automata
    - Patrik Adrián and György Vaszil. A GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation

    11:00 - 11:30 Coffee Break

    11:30 - 12:30 Invited Talk: (Unifying DLT & NCMA): Martin Kutrib (Chair: Giovanni Pighizzini)

    12:30 Closing NCMA, followed by DLT until the end of the week