Skip to main content
  • Conference proceedings
  • © 2020

Descriptional Complexity of Formal Systems

22nd International Conference, DCFS 2020, Vienna, Austria, August 24–26, 2020, Proceedings

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): DCFS: International Conference on Descriptional Complexity of Formal Systems

Conference proceedings info: DCFS 2020.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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

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

Table of contents (19 papers)

  1. Front Matter

    Pages i-x
  2. Mutually Accepting Capacitated Automata

    • Ravid Alon, Orna Kupferman
    Pages 1-12
  3. Bad Pictures: Some Structural Properties Related to Overlaps

    • Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi
    Pages 13-25
  4. Regular Expression Length via Arithmetic Formula Complexity

    • Ehud Cseresnyes, Hannes Seiwert
    Pages 26-38
  5. On the Power of Generalized Forbidding Insertion-Deletion Systems

    • Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
    Pages 52-63
  6. Multiple Concatenation and State Complexity (Extended Abstract)

    • Jozef Jirásek, Galina Jirásková
    Pages 78-90
  7. Longer Shortest Strings in Two-Way Finite Automata

    • Stanislav Krymski, Alexander Okhotin
    Pages 104-116
  8. Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion

    • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
    Pages 117-129
  9. Descriptional Complexity of Winning Sets of Regular Languages

    • Pierre Marcus, Ilkka Törmä
    Pages 130-141
  10. State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages

    • Alexander Okhotin, Elizaveta Sazhneva
    Pages 142-154
  11. On the Generative Power of Quasiperiods

    • Ludwig Staiger
    Pages 219-230
  12. Insertion-Deletion with Substitutions II

    • Martin Vu, Henning Fernau
    Pages 231-243

Other Volumes

  1. Descriptional Complexity of Formal Systems

About this book

This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis.

The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others.

Editors and Affiliations

  • Slovak Academy of Sciences, Košice, Slovakia

    Galina Jirásková

  • University of Milan, Milan, Italy

    Giovanni Pighizzini

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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