


default search action
26th DCFS 2025: Loughborough, UK
- Andreas Malcher
, Luca Prigioniero
:
Descriptional Complexity of Formal Systems - 26th IFIP WG 1.02 International Conference, DCFS 2025, Loughborough, UK, July 22-24, 2025, Proceedings. Lecture Notes in Computer Science 15759, Springer 2025, ISBN 978-3-031-97099-3 - Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi:
Fibonacci Pictures on a Binary Alphabet. 1-16 - Ivan Baburin, Ryan Cotterell:
A Close Analysis of the Subset Construction. 17-33 - Christian Beth
, Pamela Fleischmann
, Annika Huch
, Daniyal Kazempour
, Peer Kröger
, Andrea Kulow, Matthias Renz
:
k-Local Graphs. 34-49 - Philipp Böll, Pamela Fleischmann, Annika Huch, Jana Kreiß, Tim Löck, Kajus Park, Max Wiedenhöft
:
Word-Representable Graphs and Locality of Words. 50-63 - Sabine Broda
, António Machiavelo
, Nelma Moreira
, Rogério Reis
:
Automata for Synchronised Shuffle on Backbones. 64-78 - Guilherme Duarte
, Nelma Moreira
, Rogério Reis
:
Two-Word Shuffle: Some Results. 79-93 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman, György Vaszil:
Matrix Forbidding Grammars. 94-107 - Justus Greve-Kramer, Tore Koß, Florin Manea
, Timo Specht:
On the Decidability and Expressive Power of Several Theories Based on String Constraints. 108-122 - Martin Havel
, Alexander Meduna
, Zbynek Krivka
:
Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals Are Computationally Complete. 123-136 - Nikita Ivanov, Alexander A. Rubtsov
, Mikhail N. Vyalyi
:
Disjunctive Complexity. 137-150 - Martin Kutrib
, Andreas Malcher
, Carlo Mereghetti
, Beatrice Palano
:
Two-Way Finite Automata with Translucent Input Letters. 151-165 - J. Andres Montoya:
Relative Densities of Formal Languages. 166-179 - Frantisek Mráz, Friedrich Otto
:
On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words. 180-195 - Tomoyuki Yamakami:
What is the Most Natural Generalized Pumping Lemma beyond Regular and Context-Free Languages? 196-210 - Derek Youngman, Kai Salomaa:
Small Balanced Vertex Separators in NFA to Regular Expression Conversion. 211-223

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.