Skip to main content
Springer Nature Link
Account

Descriptional Complexity of Formal Systems

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

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Martin Kutrib

    1. Institut für Informatik, Universität Giessen, Giessen, Germany

  2. Nelma Moreira

    1. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Porto, Portugal

  3. Rogério Reis

    1. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Porto, Portugal

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: DCFS 2012.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Papers

    1. Computing with Capsules

      • Jean-Baptiste Jeannin, Dexter Kozen
      Pages 1-19

    2. Minicomplexity

      • Christos A. Kapoutsis
      Pages 20-42

    3. Logical Analysis of Hybrid Systems

      • André Platzer
      Pages 43-49

    4. Groups and Automata: A Perfect Match

      • Pedro V. Silva
      Pages 50-63

  3. Regular Papers

    1. Uniform Distributed Pushdown Automata Systems

      • Fernando Arroyo, Juan Castellanos, Victor Mitrana
      Pages 64-75

    2. Removing Nondeterminism in Constant Height Pushdown Automata

      • Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
      Pages 76-88

    3. On Inverse Operations and Their Descriptional Complexity

      • Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini
      Pages 89-102

    4. Deciding Representability of Sets of Words of Equal Length

      • Francine Blanchet-Sadri, Sean Simmons
      Pages 103-116

    5. Syntactic Complexities of Some Classes of Star-Free Languages

      • Janusz Brzozowski, Baiyu Li
      Pages 117-129

    6. Randomness Behaviour in Blum Universal Static Complexity Spaces

      • Cezar Câmpeanu
      Pages 130-140

    7. Production Complexity of Some Operations on Context-Free Languages

      • Jürgen Dassow, Ronny Harbich
      Pages 141-154

    8. State Complexity of Star and Square of Union of k Regular Languages

      • Yuan Gao, Lila Kari
      Pages 155-168

    9. State Complexity of Chop Operations on Unary and Finite Languages

      • Markus Holzer, Sebastian Jakobi
      Pages 169-182

    10. On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars

      • Artur Jeż, Alexander Okhotin
      Pages 183-195

    11. Descriptional Complexity of Biautomata

      • Galina Jirásková, Ondřej Klíma
      Pages 196-208

    12. Descriptional Complexity of Pushdown Store Languages

      • Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
      Pages 209-221

    13. On Internal Contextual Grammars with Subregular Selection Languages

      • Florin Manea, Bianca Truthe
      Pages 222-235

    14. An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets

      • Alexander Meduna, Lukáš Vrábel, Petr Zemek
      Pages 236-243

    15. Centralized PC Systems of Pushdown Automata versus Multi-head Pushdown Automata

      • Friedrich Otto
      Pages 244-251
Back to top

Other volumes

  1. Descriptional Complexity of Formal Systems

Editors and Affiliations

  • Institut für Informatik, Universität Giessen, Giessen, Germany

    Martin Kutrib

  • Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Porto, Portugal

    Nelma Moreira, Rogério Reis

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top