Descriptional Complexity of Formal Systems 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, Proceedings / [electronic resource] :
edited by Martin Kutrib, Nelma Moreira, Rogério Reis.
- 1st ed. 2012.
- X, 319 p. 23 illus. online resource.
- Theoretical Computer Science and General Issues, 7386 2512-2029 ; .
- Theoretical Computer Science and General Issues, 7386 .
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.
9783642316234
10.1007/978-3-642-31623-4 doi
Computer science.
Machine theory.
Theory of Computation.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
QA75.5-76.95
004.0151
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.
9783642316234
10.1007/978-3-642-31623-4 doi
Computer science.
Machine theory.
Theory of Computation.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
QA75.5-76.95
004.0151