Skip to main content
SpringerLink
Log in
Book cover

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Nelma Moreira

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Rogério Reis

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 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

Table of contents (24 papers)

  1. Regular Papers

    1. State Complexity and Limited Nondeterminism

      • Alexandros Palioudakis, Kai Salomaa, Selim G. Akl
      Pages 252-265

    2. Bounded Counter Languages

      • Holger Petersen
      Pages 266-279

    3. State Complexity of Projection and Quotient on Unranked Trees

      • Xiaoxue Piao, Kai Salomaa
      Pages 280-293

    4. Iterating Invertible Binary Transducers

      • Klaus Sutner, Kevin Lewi
      Pages 294-306

    5. Minimal DFA for Symmetric Difference NFA

      • Brink van der Merwe, Hellis Tamm, Lynette van Zijl
      Pages 307-318

  2. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Descriptional Complexity of Formal Systems

Keywords

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.

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

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation