Descriptional Complexity of Formal Systems

17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings

  • Jeffrey Shallit
  • Alexander Okhotin
Conference proceedings DCFS 2015

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9118)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Invited Talk

    1. Front Matter
      Pages 1-1
    2. Thomas Colcombet
      Pages 3-18
  3. Contributed Papers

    1. Front Matter
      Pages 19-19
    2. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
      Pages 21-32
    3. Janusz Brzozowski, Marek Szykuła
      Pages 33-45
    4. Cezar Câmpeanu, Kai Salomaa
      Pages 46-57
    5. Juris Čerņenoks, Jānis Iraids, Mārtiņš Opmanis, Rihards Opmanis, Kārlis Podnieks
      Pages 58-69
    6. Kristína Čevorová
      Pages 70-80
    7. Sebastian Eberhard, Stefan Hetzl
      Pages 93-104
    8. Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
      Pages 105-116
    9. Jozef Štefan Jirásek, Juraj Šebej
      Pages 129-140
    10. Lila Kari, Stavros Konstantinidis, Steffen Kopecki
      Pages 141-152
    11. Martin Kutrib, Matthias Wendlandt
      Pages 153-164
    12. Taisia Mischenko-Slatenkova, Alina Vasilieva, Ilja Kucevalovs, Rūsiņš Freivalds
      Pages 177-184
    13. Peter Mlynárčik
      Pages 185-196
    14. Nelma Moreira, Giovanni Pighizzini, Rogério Reis
      Pages 197-208

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 17th International Conference on Descriptional Complexity of Formal Systems, DCFS 2015, held in Waterloo, ON, Canada, in June 2015. The 23 full papers presented  together with 2 invited talks were carefully reviewed and selected from 29 submissions.

The subject of the workshop was descriptional complexity. Roughly speaking, this  field is concerned with the size of objects in various mathematical models of computation, such as finite automata, pushdown automata, and Turing machines. Descriptional complexity serves as a theoretical representation of physical realizations, such as the engineering complexity of computer software and hardware. It also models similar complexity phenomena in other areas of computer science, including unconventional computing and bioinformatics.

Keywords

DNA properties Decision problem Descriptional complexity Distance measures Finite automata Finite languages Formal languages Integer complexity Measures of nondeterminism Nondeterministic finite automat Ordered rewriting Permutation automaton Petri net language Quantum state complexity Regular languages State complexity Trajectories Transducers Undecidability Weighted finite automata

Editors and affiliations

  • Jeffrey Shallit
    • 1
  • Alexander Okhotin
    • 2
  1. 1.School of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Department of MathematicsUniversity of TurkuTurkuFinland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-19225-3
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-19224-6
  • Online ISBN 978-3-319-19225-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book