04091nam 22007455 450 991048501970332120251226200623.03-642-39310-110.1007/978-3-642-39310-5(CKB)2560000000105703(DE-He213)978-3-642-39310-5(SSID)ssj0000936433(PQKBManifestationID)11530910(PQKBTitleCode)TC0000936433(PQKBWorkID)10962358(PQKB)10431361(MiAaPQ)EBC3101154(PPN)170493210(EXLCZ)99256000000010570320130615d2013 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierDescriptional Complexity of Formal Systems 15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings /edited by Jürgensen, Rogério Reis1st ed. 2013.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2013.1 online resource (X, 289 p. 56 illus.) Theoretical Computer Science and General Issues,2512-2029 ;8031Bibliographic Level Mode of Issuance: Monograph3-642-39309-8 Includes bibliographical references and index.This book constitutes the refereed proceedings of the 15th International Workshop of Descriptional Complexity of Formal Systems, DCFS 2013, held in London, ON, Canada, in July 2013. The 22 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 46 submissions. The topics covered are automata, grammars, languages and other formal systems; various modes of operations and complexity measures; co-operating systems; succinctness of description of objects, state-explosion-like phenomena; circuit complexity of Boolean functions and related measures; size complexity and structural complexity of formal systems; trade-offs between computational models and mode of operation; applications of formal systems; for instance in software and hardware testing, in dialogue systems, in systems modeling or in modeling natural languages; and their complexity constraints; size or structural complexity of formal systems for modeling natural languages; complexity aspects related to the combinatorics of words; descriptional complexity in resource-bounded or structure-bounded environments; structural complexity as related to descriptional complexity; frontiers between decidability and undecidability; universality and reversibility; nature-motivated (bio-inspired) architectures and unconventional models of computing; Kolmogorov-Chaitin complexity, algorithmic information.Theoretical Computer Science and General Issues,2512-2029 ;8031Computer scienceMachine theoryAlgorithmsComputer scienceMathematicsDiscrete mathematicsTheory of ComputationFormal Languages and Automata TheoryComputer Science Logic and Foundations of ProgrammingAlgorithmsDiscrete Mathematics in Computer ScienceComputer science.Machine theory.Algorithms.Computer scienceMathematics.Discrete mathematics.Theory of Computation.Formal Languages and Automata Theory.Computer Science Logic and Foundations of Programming.Algorithms.Discrete Mathematics in Computer Science.005.131Jürgensenedthttp://id.loc.gov/vocabulary/relators/edtReis Rogérioedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910485019703321Descriptional Complexity of Formal Systems1904989UNINA