Descriptional Complexity of Formal Systems
16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings
Published on 11. July 2014
XII, 366 pages
978-3-319-09704-6 (ISBN)
Description
This book constitutes the refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs between computational models and modes of operation; succinctness of description of 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; complexity aspects of combinatorics on words; Kolmogorov complexity.
More details
Other editions
Additional editions
Helmut Jürgensen | Juhani Karhumäki | Alexander Okhotin
Descriptional Complexity of Formal Systems
16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings
Book
07/2014
Springer
€53.49
Shipment within 10-15 days
Content
Automata, grammars, languages and other formal systems.- Various modes of operation and complexity measures.- Trade-offs between computational models and modes of operation.- Succinctness of description of 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.- Complexity aspects of combinatorics on words.- Kolmogorov complexity.
