LEADER 04645nam 22007935 450 001 996198266703316 005 20230329141549.0 010 $a3-319-09704-0 024 7 $a10.1007/978-3-319-09704-6 035 $a(CKB)3710000000219435 035 $a(SSID)ssj0001296383 035 $a(PQKBManifestationID)11716431 035 $a(PQKBTitleCode)TC0001296383 035 $a(PQKBWorkID)11347592 035 $a(PQKB)10625751 035 $a(DE-He213)978-3-319-09704-6 035 $a(MiAaPQ)EBC6285658 035 $a(MiAaPQ)EBC5587391 035 $a(Au-PeEL)EBL5587391 035 $a(OCoLC)884434842 035 $a(PPN)179925970 035 $a(EXLCZ)993710000000219435 100 $a20140711d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDescriptional Complexity of Formal Systems$b[electronic resource] $e16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings /$fedited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin 205 $a1st ed. 2014. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014. 215 $a1 online resource (XII, 366 p. 59 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8614 300 $aIncludes index. 311 $a3-319-09703-2 327 $aAutomata, 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8614 606 $aComputer science 606 $aMachine theory 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer science. 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004.0151 702 $aJürgensen$b Helmut$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKarhumäki$b Juhani$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOkhotin$b Alexander$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996198266703316 996 $aDescriptional Complexity of Formal Systems$91904989 997 $aUNISA