Descriptional Complexity of Formal Systems

14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings

  • Martin Kutrib
  • Nelma Moreira
  • Rogério Reis
Conference proceedings DCFS 2012
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7386)

Table of contents

  1. Front Matter
  2. Invited Papers

    1. Jean-Baptiste Jeannin, Dexter Kozen
      Pages 1-19
    2. Christos A. Kapoutsis
      Pages 20-42
    3. André Platzer
      Pages 43-49
    4. Pedro V. Silva
      Pages 50-63
  3. Regular Papers

    1. Fernando Arroyo, Juan Castellanos, Victor Mitrana
      Pages 64-75
    2. Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
      Pages 76-88
    3. Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini
      Pages 89-102
    4. Francine Blanchet-Sadri, Sean Simmons
      Pages 103-116
    5. Janusz Brzozowski, Baiyu Li
      Pages 117-129
    6. Jürgen Dassow, Ronny Harbich
      Pages 141-154
    7. Markus Holzer, Sebastian Jakobi
      Pages 169-182
    8. Galina Jirásková, Ondřej Klíma
      Pages 196-208
    9. Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
      Pages 209-221

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 14th International Workshop of Descriptional Complexity of Formal Systems 2012, held in Braga, Portugal, in July 2012.
The 20 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 33 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) 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; Kolmogorov complexity.

Keywords

context-free languages contextual grammars nondeterminism pushdown automata state complexity

Editors and affiliations

  • Martin Kutrib
    • 1
  • Nelma Moreira
    • 2
  • Rogério Reis
    • 2
  1. 1.Institut für InformatikUniversität GiessenGiessenGermany
  2. 2.Departamento de Ciência de ComputadoresUniversidade do Porto, Faculdade de CiênciasPortoPortugal

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-31623-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-31622-7
  • Online ISBN 978-3-642-31623-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book