Descriptional Complexity of Formal Systems [electronic resource] : 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings / edited by Martin Kutrib, Nelma Moreira, Rogério Reis.
By: Kutrib, Martin [editor.].
Contributor(s): Moreira, Nelma [editor.] | Reis, Rogério [editor.] | SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 7386Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012Description: X, 319p. 23 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642316234.Subject(s): Computer science | Logic design | Computer Science | Computation by Abstract Devices | Mathematical Logic and Formal Languages | Logics and Meanings of ProgramsDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
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.
There are no comments for this item.