Descriptional Complexity of Formal Systems 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings / [electronic resource] :
edited by Helmut J�urgensen, Juhani Karhum�aki, Alexander Okhotin.
- XII, 366 p. 59 illus. online resource.
- Lecture Notes in Computer Science, 8614 0302-9743 ; .
- Lecture Notes in Computer Science, 8614 .
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.
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.
9783319097046
10.1007/978-3-319-09704-6 doi
Computer science.
Computers.
Algorithms.
Computer logic.
Mathematical logic.
Computer science--Mathematics.
Computer Science.
Computation by Abstract Devices.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
QA75.5-76.95
004.0151
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.
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.
9783319097046
10.1007/978-3-319-09704-6 doi
Computer science.
Computers.
Algorithms.
Computer logic.
Mathematical logic.
Computer science--Mathematics.
Computer Science.
Computation by Abstract Devices.
Mathematical Logic and Formal Languages.
Logics and Meanings of Programs.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
QA75.5-76.95
004.0151