Descriptional Complexity of Formal Systems

19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings

  • Giovanni Pighizzini
  • Cezar Câmpeanu
Conference proceedings DCFS 2017

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

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

Table of contents

  1. Front Matter
    Pages I-X
  2. Invited Papers

    1. Front Matter
      Pages 1-1
    2. Shaull Almagor, Denis Kuperberg, Orna Kupferman
      Pages 3-15
    3. Marcella Anselmo, Dora Giammarresi, Maria Madonia
      Pages 16-32
  3. Contributed Papers

    1. Front Matter
      Pages 63-63
    2. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
      Pages 77-88
    3. Janusz A. Brzozowski, Sylvie Davies
      Pages 89-101
    4. Maksims Dimitrijevs, Abuzer Yakaryılmaz
      Pages 102-113
    5. Rachel Faran, Orna Kupferman
      Pages 114-127
    6. Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman
      Pages 128-139
    7. Yo-Sub Han, Hwee Kim, Trent A. Rogers, Shinnosuke Seki
      Pages 164-176
    8. Markus Holzer, Martin Kutrib
      Pages 177-188
    9. Jozef Jirásek Jr., Matúš Palmovský, Juraj Šebej
      Pages 189-201
    10. Chris Keeler, Kai Salomaa
      Pages 202-213
    11. Ivana Krajňáková, Galina Jirásková
      Pages 214-225

About these proceedings

Introduction

This book constitutes the proceedings of the 19th International Conference on Descriptional Complexity of Formal Systems, DCFS 2017, held in Milano, Italy, in July 2017. The 20 full papers presented together with 4 invited talks were carefully reviewed and selected from 26 submissions.Descriptional Complexity is a field in Computer Science that deals with the size of all kinds of objects that occur in computational models, such as turing machines, finite automata, grammars, splicing systems and others. The topics of this conference are related to all aspects of descriptional complexity.

Keywords

descriptional complexity automata theory formal languages context free languages regular languages Turing machines automata extensions computational completeness graph-controlled systems information theory insertion-deletion systems models of computation quantitative automata state complexity syntactic complexity theory of computation language upper bounds algorithms

Editors and affiliations

  1. 1.Università degli Studi di MilanoMilanItaly
  2. 2.University of Prince Edward IslandCharlottetownCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-60252-3
  • Copyright Information IFIP International Federation for Information Processing 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-60251-6
  • Online ISBN 978-3-319-60252-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book