Skip to main content

Descriptional Complexity of Formal Systems

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

  • Conference proceedings
  • © 2012

Overview

  • 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

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Keywords

Table of contents (24 papers)

  1. Invited Papers

  2. Regular Papers

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

Bibliographic Information

Publish with us