- 10% rabatt på allt
Descriptional Complexity of Formal Systems
14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, Proceedings
739 kr
Läs direkt i Bokus Reader – eller ladda ned till din enhet (PDF kräver ofta zoom och scroll på små skärmar).
Beskrivning
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.