04620nam 22007935 450 991048414680332120230329141549.03-319-09704-010.1007/978-3-319-09704-6(CKB)3710000000219435(SSID)ssj0001296383(PQKBManifestationID)11716431(PQKBTitleCode)TC0001296383(PQKBWorkID)11347592(PQKB)10625751(DE-He213)978-3-319-09704-6(MiAaPQ)EBC6285658(MiAaPQ)EBC5587391(Au-PeEL)EBL5587391(OCoLC)884434842(PPN)179925970(EXLCZ)99371000000021943520140711d2014 u| 0engurnn#008mamaatxtccrDescriptional Complexity of Formal Systems 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings /edited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin1st ed. 2014.Cham :Springer International Publishing :Imprint: Springer,2014.1 online resource (XII, 366 p. 59 illus.)Theoretical Computer Science and General Issues,2512-2029 ;8614Includes index.3-319-09703-2 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.Theoretical Computer Science and General Issues,2512-2029 ;8614Computer scienceMachine theoryAlgorithmsComputer science—MathematicsDiscrete mathematicsTheory of ComputationFormal Languages and Automata TheoryComputer Science Logic and Foundations of ProgrammingAlgorithmsDiscrete Mathematics in Computer ScienceComputer science.Machine theory.Algorithms.Computer science—Mathematics.Discrete mathematics.Theory of Computation.Formal Languages and Automata Theory.Computer Science Logic and Foundations of Programming.Algorithms.Discrete Mathematics in Computer Science.004.0151Jürgensen Helmutedthttp://id.loc.gov/vocabulary/relators/edtKarhumäki Juhaniedthttp://id.loc.gov/vocabulary/relators/edtOkhotin Alexanderedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910484146803321Descriptional Complexity of Formal Systems1904989UNINA