Skip to main content
SpringerLink
Log in

Descriptional Complexity of Formal Systems

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

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Galina Jirásková

    1. Slovak Academy of Sciences, Košice, Slovakia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giovanni Pighizzini

    1. University of Milan, Milan, Italy

    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 12442)

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

Included in the following conference series:

Conference proceedings info: DCFS 2020.

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 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

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  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. Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable

    • Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
    Pages 39-51

  6. On the Power of Generalized Forbidding Insertion-Deletion Systems

    • Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
    Pages 52-63

  7. State Complexity Bounds for the Commutative Closure of Group Languages

    • Stefan Hoffmann
    Pages 64-77

  8. Multiple Concatenation and State Complexity (Extended Abstract)

    • Jozef Jirásek, Galina Jirásková
    Pages 78-90

  9. Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata

    • Chris Keeler, Kai Salomaa
    Pages 91-103

  10. Longer Shortest Strings in Two-Way Finite Automata

    • Stanislav Krymski, Alexander Okhotin
    Pages 104-116

  11. Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion

    • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
    Pages 117-129

  12. Descriptional Complexity of Winning Sets of Regular Languages

    • Pierre Marcus, Ilkka Törmä
    Pages 130-141

  13. State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages

    • Alexander Okhotin, Elizaveta Sazhneva
    Pages 142-154

  14. Complexity of Two-Dimensional Rank-Reducing Grammars

    • Daniel Průša
    Pages 155-166

  15. Palindromic Length of Words with Many Periodic Palindromes

    • Josef Rukavicka
    Pages 167-179

  16. Operational Complexity of Straight Line Programs for Regular Languages

    • Hannes Seiwert
    Pages 180-192

  17. Classifying \(\omega \)-Regular Aperiodic k-Partitions

    • Victor Selivanov
    Pages 193-205

  18. Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata

    • Taylor J. Smith, Kai Salomaa
    Pages 206-218

  19. On the Generative Power of Quasiperiods

    • Ludwig Staiger
    Pages 219-230

  20. Insertion-Deletion with Substitutions II

    • Martin Vu, Henning Fernau
    Pages 231-243
Back to top

Other volumes

  1. Descriptional Complexity of Formal Systems

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation