Descriptional Complexity of Formal Systems

16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings

  • Helmut Jürgensen
  • Juhani Karhumäki
  • Alexander Okhotin
Conference proceedings DCFS 2014

DOI: 10.1007/978-3-319-09704-6

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

Table of contents (31 papers)

  1. Front Matter
  2. Star-Free Languages and Local Divisors
    Manfred Kufleitner
    Pages 23-28
  3. Aperiodic Tilings by Right Triangles
    Nikolay Vereshchagin
    Pages 29-41
  4. Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
    Farid Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryılmaz
    Pages 53-64
  5. Matter and Anti-Matter in Membrane Systems
    Artiom Alhazov, Bogdan Aman, Rudolf Freund, Gheorghe Păun
    Pages 65-76
  6. Complexity of Extended vs. Classic LR Parsers
    Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi, Angelo Morzenti
    Pages 77-89
  7. Most Complex Regular Right-Ideal Languages
    Janusz Brzozowski, Gareth Davies
    Pages 90-101
  8. State Complexity of Inversion Operations
    Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
    Pages 102-113
  9. Cycles and Global Attractors of Reaction Systems
    Enrico Formenti, Luca Manzoni, Antonio E. Porreca
    Pages 114-125
  10. Classical Automata on Promise Problems
    Viliam Geffert, Abuzer Yakaryılmaz
    Pages 126-137
  11. From Ultrafilters on Words to the Expressive Power of a Fragment of Logic
    Mai Gehrke, Andreas Krebs, Jean-Éric Pin
    Pages 138-149
  12. Computation Width and Deviation Number
    Daniel Goč, Kai Salomaa
    Pages 150-161
  13. Boundary Sets of Regular and Context-Free Languages
    Markus Holzer, Sebastian Jakobi
    Pages 162-173
  14. Biclique Coverings, Rectifier Networks and the Cost of ε-Removal
    Szabolcs Iván, Ádám D. Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
    Pages 174-185
  15. Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
    Sergiu Ivanov, Elisabeth Pelz, Sergey Verlan
    Pages 186-197
  16. A Full and Linear Index of a Tree for Tree Patterns
    Jan Janoušek, Bořivoj Melichar, Radomír Polách, Martin Poliak, Jan Trávníček
    Pages 198-209
  17. Prefix-Free Languages: Right Quotient and Reversal
    Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárčik, Juraj Šebej
    Pages 210-221

About these proceedings


This book constitutes the refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs between computational models and modes of operation; succinctness of description of objects, state explosion-like phenomena; circuit complexity of Boolean functions and related measures; resource-bounded or structure-bounded environments; frontiers between decidability and undecidability; universality and reversibility; structural complexity; formal systems for applications (e.g., software reliability, software and hardware testing, modeling of natural languages); nature-motivated (bio-inspired) architectures and unconventional models of computing; complexity aspects of combinatorics on words; Kolmogorov complexity.


context-free languages error-correcting codes quantum computation regular languages turing machines

Editors and affiliations

  • Helmut Jürgensen
    • 1
  • Juhani Karhumäki
    • 2
  • Alexander Okhotin
    • 3
  1. 1.Department of Computer ScienceThe University of Western OntarioLondonCanada
  2. 2.Department of Mathematics and TUCSUniversity of TurkuTurkuFinland
  3. 3.University of TurkuTurkuFinland

Bibliographic information

  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-09703-9
  • Online ISBN 978-3-319-09704-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349