Accepted papers

Accepted papers for DLT 2026

• Mehdi Golafshan and Michel Rigo. Thue-Morse Series and k-ary Partitions
• Théo Grente, Étienne Grandjean and Véronique Terrier. Context-free, conjunctive and Boolean grammars and SCYK automata
• Andrea Frosini, Shin-Ichi Nakano and Simone Rinaldi. Generation and Enumeration of Floorplans determined by HV-matrices
• Peter Kostolányi and Andrej Ravinger. Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
• Laura Ciobanu and Daniel Turaev. Visibly Pushdown Languages in Groups
• Katalin Lazar, Florin Manea, Stefan Siemer and Timo Specht. Self-assembly of Strings and Languages Revisited: Efficiently Deciding Closure under Self-Assembly
• Simone Rinaldi, Paolo Massazza and Lama Tarsissi. Centered Ascending Polyominoes
• Svetlana Puzynina and Olga Karmanova. Small abelian complexity of multidimensional words
• Peter Habermehl and Erwann Loulergue. Passive Learning of Symbolic Automata over Monotonic Algebras
• Arnaud Carayol and Lucien Charamond. Tree representations of infinite words and their logical properties
• Giuseppa Castiglione, Sabrina Mantaci, Antonio Restivo, Giuseppe Romana and Marinella Sciortino. Efficient Computation of Discriminative Absent Words for String Collections
• Kévin Dubrulle, Véronique Bruyère, Guillermo Alberto Pérez and Gaëtan Staquet. Visibly Recursive Automata
• Daniel Průša, Michael Wehar and Chen Xu. The Four Corners Problem Over Larger Alphabets
• Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia and Sabrina Mantaci. Transformations between Minimally f-free Words
• Henning Fernau, Pamela Fleischmann, Kevin Mann and Silas Cato Sacher. On Languages Describing Large Graph Classes
• Delaram Moradi, Narad Rampersad and Jeffrey Shallit. Complexity of Linear Subsequences of Fibonacci-Automatic Sequences
• Nicola Cotumaccio. Generalized Wheeler Automata: Minimality
• Dorian Guyot and Ulrich Ultes-Nitsche. The Joker Game Only Characterizes History-Determinism in Parity Automata With up to Two Priorities
• Paul C. Bell, George Kenison, Reino Niskanen, Igor Potapov and Pavel Semukhin. On Word Representations and Embeddings in Complex Matrices
• Stefano Crespi Reghizzi, Antonio Restivo and Pierluigi San Pietro. Closure operations on picture languages and their relation to floor plans
• Guilherme Duarte, Nelma Moreira, Luca Prigioniero and Rogério Reis. On the Descriptional Complexity of Literal Shuffle
• Yahia Idriss Benalioua, Nathan Lhote and Pierre-Alain Reynier. Minimizing Streaming String Transducers: An algebraic approach

Accepter papers for NCMA 2026

TBA