Descriptional Complexity of Formal Systems

13 International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings
2011
ISBN: 978-3-642-22599-4
Verlag: Springer

Buch, Englisch, Band 6808, 329 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 517 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Holzer, Markus

Pighizzini, Giovanni

Kutrib, Martin

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Berechenbarkeitstheorie, Komplexitätstheorie
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten