|
|
|
|
| LEADER |
03305nmm a2200385 u 4500 |
| 001 |
EB000892544 |
| 003 |
EBX01000000000000000689664 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140801 ||| eng |
| 020 |
|
|
|a 9783319097046
|
| 100 |
1 |
|
|a Jürgensen, Helmut
|e [editor]
|
| 245 |
0 |
0 |
|a Descriptional Complexity of Formal Systems
|h Elektronische Ressource
|b 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings
|c edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin
|
| 250 |
|
|
|a 1st ed. 2014
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2014, 2014
|
| 300 |
|
|
|a XII, 366 p. 59 illus
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Karhumäki, Juhani
|e [editor]
|
| 700 |
1 |
|
|a Okhotin, Alexander
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/978-3-319-09704-6
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-09704-6?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a 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
|