Descriptional Complexity of Formal Systems

15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings

  • Helmut Jurgensen
  • Rogério Reis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8031)

Table of contents

  1. Front Matter
  2. Cezar Câmpeanu
    Pages 1-13
  3. Pierre McKenzie
    Pages 17-17
  4. Klaus Sutner
    Pages 18-29
  5. Hae-Sung Eom, Yo-Sub Han, Galina Jirásková
    Pages 54-65
  6. Hae-Sung Eom, Yo-Sub Han, Sang-Ki Ko
    Pages 66-77
  7. Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
    Pages 90-101
  8. Daniel Goč, Alexandros Palioudakis, Kai Salomaa
    Pages 102-111
  9. Markus Holzer, Sebastian Jakobi
    Pages 112-123
  10. Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano
    Pages 124-135
  11. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
    Pages 148-159
  12. Francisco Mota, Scott Aaronson, Luís Antunes, André Souto
    Pages 172-181
  13. Hamoon Mousavi, Jeffrey Shallit
    Pages 182-193

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 15th International Workshop of Descriptional Complexity of Formal Systems, DCFS 2013, held in London, ON, Canada, in July 2013. The 22 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 46 submissions.
The topics covered are automata, grammars, languages and other formal systems; various modes of operations and complexity measures; co-operating systems; succinctness of description of objects, state-explosion-like phenomena; circuit complexity of Boolean functions and related measures; size complexity and structural complexity of formal systems; trade-offs between computational models and mode of operation; applications of formal systems; for instance in software and hardware testing, in dialogue systems, in systems modeling or in modeling natural languages; and their complexity constraints; size or structural complexity of formal systems for modeling natural languages; complexity aspects related to the combinatorics of words; descriptional complexity in resource-bounded or structure-bounded environments; structural complexity as related to descriptional complexity; frontiers between decidability and undecidability; universality and reversibility; nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov-Chaitin complexity, algorithmic information.

Keywords

context-free languages descriptional complexity finite automata regular expressions turing machines

Editors and affiliations

  • Helmut Jurgensen
    • 1
  • Rogério Reis
    • 2
  1. 1.Department of Computer Science, Middlesex CollegeWestern UniversityLondonCanada
  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-39310-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-39309-9
  • Online ISBN 978-3-642-39310-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book