Skip to main content
  • Conference proceedings
  • © 2019

Descriptional Complexity of Formal Systems

21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019, Proceedings

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

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

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 (22 papers)

  1. Front Matter

    Pages i-x
  2. Low-Complexity Tilings of the Plane

    • Jarkko Kari
    Pages 35-45
  3. State Complexity of Single-Word Pattern Matching in Regular Languages

    • Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan
    Pages 86-97
  4. Descriptional Complexity of Matrix Simple Semi-conditional Grammars

    • Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
    Pages 111-123
  5. Regulated Tree Automata

    • Henning Fernau, Martin Vu
    Pages 124-136
  6. Generalized de Bruijn Words and the State Complexity of Conjugate Sets

    • Daniel Gabric, Štěpán Holub, Jeffrey Shallit
    Pages 137-146
  7. The Syntactic Complexity of Semi-flower Languages

    • Kitti Gelle, Szabolcs Iván
    Pages 147-157
  8. Computability on Quasi-Polish Spaces

    • Mathieu Hoyrup, Cristóbal Rojas, Victor Selivanov, Donald M. Stull
    Pages 171-183
  9. NFA-to-DFA Trade-Off for Regular Operations

    • Galina Jirásková, Ivana Krajňáková
    Pages 184-196
  10. State Complexity of Simple Splicing

    • Lila Kari, Timothy Ng
    Pages 197-209
  11. Nondeterminism Growth and State Complexity

    • Chris Keeler, Kai Salomaa
    Pages 210-222
  12. Descriptional Complexity of Iterated Uniform Finite-State Transducers

    • Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
    Pages 223-234
  13. On Classes of Regular Languages Related to Monotone WQOs

    • Mizuhito Ogawa, Victor Selivanov
    Pages 235-247
  14. State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages

    • Alexander Okhotin, Elizaveta Sazhneva
    Pages 248-259

Other Volumes

  1. Descriptional Complexity of Formal Systems

About this book

This book constitutes the proceedings of the 21st International Conference on Descriptional Complexity of Format Systems, DCFS 2019, held in Košice, Slovakia, in July 2019.

The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. 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

    Michal Hospodár, Galina Jirásková

  • Saint Mary's University, Halifax, Canada

    Stavros Konstantinidis

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