Descriptional Complexity of Formal Systems : 13 International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings

Markus Holzer

ISBN 10: 3642225993 / ISBN 13: 9783642225994

Verlag: Springer Berlin Heidelberg, 2011

Beschreibung

Druck auf Anfrage Neuware - Printed after ordering - 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.

Bestandsnummer des Verkäufers 9783642225994

Bibliografische Details

• Titel: Descriptional Complexity of Formal Systems : 13 International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings
• Verlag: Springer Berlin Heidelberg
• Erscheinungsjahr: 2011
• Sprache: Englisch
• ISBN-10: 3642225993
• ISBN-13: 9783642225994
• Einband: Taschenbuch
• Zustand: Neu
• Abmessungen: 235B x 155 H x 19 T Millimeter Breite: 235 mm, Höhe: 155 mm, Tiefe: 19 mm
• Gewicht: 517 Gramm

Über diesen Titel

Inhaltsangabe

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.