Skip to main content
SpringerLink
Log in

Descriptional Complexity of Formal Systems

25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings

  • Conference proceedings
  • © 2023

Overview

Editors:
  1. Henning Bordihn

    1. University of Potsdam, Potsdam, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Nicholas Tran

    1. Santa Clara University, Santa Clara, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. György Vaszil

    1. University of Debrecen, Debrecen, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 13918)

Included in the following conference series:

Conference proceedings info: DCFS 2023.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (14 papers)

  1. Front Matter

    Pages i-xvi
    Download chapter PDF

  2. Operational State Complexity Revisited: The Contribution of Monsters and Modifiers

    • Pascal Caron, Jean-Gabriel Luque, Bruno Patrou
    Pages 1-20

  3. Hypercubes and Isometric Words Based on Swap and Mismatch Distance

    • Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci
    Pages 21-35

  4. Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle

    • Michael C. Chavrimootoo
    Pages 36-50

  5. Existential and Universal Width of Alternating Finite Automata

    • Yo-Sub Han, Sungmin Kim, Sang-Ki Ko, Kai Salomaa
    Pages 51-64

  6. On Jaffe’s Pumping Lemma, Revisited

    • Markus Holzer, Christian Rauch
    Pages 65-78

  7. Operational Complexity: NFA-to-DFA Trade-Off

    • Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Šebej
    Pages 79-93

  8. The Word Problem for Finitary Automaton Groups

    • Maximilian Kotowsky, Jan Philipp Wächter
    Pages 94-108

  9. Separating Words Problem over Groups

    • Neha Kuntewar, S. K. M. Anoop, Jayalal Sarma
    Pages 109-120

  10. Complexity of Exclusive Nondeterministic Finite Automata

    • Martin Kutrib, Andreas Malcher, Matthias Wendlandt
    Pages 121-133

  11. Shortest Accepted Strings for Two-Way Finite Automata: Approaching the \(2^n\) Lower Bound

    • Olga Martynova, Alexander Okhotin
    Pages 134-145

  12. Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage

    • Giovanni Pighizzini, Luca Prigioniero
    Pages 146-157

  13. Construction of a Bi-infinite Power Free Word with a Given Factor and a Non-recurrent Letter

    • Josef Rukavicka
    Pages 158-168

  14. Merging Two Hierarchies of External Contextual Grammars with Subregular Selection

    • Bianca Truthe
    Pages 169-180

  15. A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words

    • Jean Weight, Trienko Grobler, Lynette van Zijl, Carlyle Stewart
    Pages 181-196

  16. Back Matter

    Pages 197-197
    Download chapter PDF
Back to top

Other volumes

  1. Descriptional Complexity of Formal Systems

Keywords

About this book

This book constitutes the proceedings of the 25th International Conference on Descriptional Complexity of Format Systems, DCFS 2023, which took place in Potsdam, Germany, in July 2023.

The 14 full papers, including one invited presentation as a full paper, presented in this volume were carefully reviewed and selected from 16 submissions. The conference focus on all aspects of descriptional complexity, including automata, grammars, languages, and other formal systems; various modes of operations and complexity measures.

Editors and Affiliations

  • University of Potsdam, Potsdam, Germany

    Henning Bordihn

  • Santa Clara University, Santa Clara, USA

    Nicholas Tran

  • University of Debrecen, Debrecen, Hungary

    György Vaszil

Bibliographic Information

Publish with us

Policies and ethics

Societies and partnerships

Back to top

Search

Navigation