Descriptional Complexity of Formal Systems

13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings

  • Markus Holzer
  • Martin Kutrib
  • Giovanni Pighizzini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)

Table of contents

  1. Front Matter
  2. Invited Papers

  3. Regular Papers

    1. Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit
      Pages 55-67
    2. Fernando Arroyo, Juan Castellanos, Victor Mitrana
      Pages 68-79
    3. Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
      Pages 80-92
    4. Janusz Brzozowski, Baiyu Li, Yuli Ye
      Pages 93-106
    5. Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne
      Pages 107-120
    6. Jürgen Dassow, Florin Manea, Bianca Truthe
      Pages 135-146
    7. Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, David A. Wilson
      Pages 147-157
    8. Radu Gramatovici, Florin Manea
      Pages 172-183
    9. Oscar H. Ibarra, Nicholas Q. Tran
      Pages 184-197
    10. Galina Jirásková, Tomáš Masopust
      Pages 198-211
    11. Galina Jirásková, Juraj Šebej
      Pages 212-221
    12. Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade
      Pages 235-247

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 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

automata theory complexity theory decidability theory formal language theory formal methods grammar systems verification

Editors and affiliations

  • Markus Holzer
    • 1
  • Martin Kutrib
    • 2
  • Giovanni Pighizzini
    • 3
  1. 1.Institut für InformatikUniversität GiessenGiessenGermany
  2. 2.Institut für InformatikUniversität GießenGießenGermany
  3. 3.Dipartimento di Informatica e ComunicazioneUniversità degli Studi di MilanoMilanoItaly

Bibliographic information

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