LEADER 03556nam  22006495  450 
001 996465750903316
005 20230406044052.0
010   $a3-642-22600-0
024 7 $a10.1007/978-3-642-22600-7
035   $a(CKB)2670000000099852
035   $a(SSID)ssj0000530770
035   $a(PQKBManifestationID)11344126
035   $a(PQKBTitleCode)TC0000530770
035   $a(PQKBWorkID)10568079
035   $a(PQKB)10663181
035   $a(DE-He213)978-3-642-22600-7
035   $a(MiAaPQ)EBC3067019
035   $a(PPN)156316285
035   $a(EXLCZ)992670000000099852
100   $a20110720d2011      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aDescriptional Complexity of Formal Systems$b[electronic resource] $e13 International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings /$fedited by Markus Holzer, Martin Kutrib, Giovanni Pighizzini
205   $a1st ed. 2011.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2011.
215   $a1 online resource (X, 329 p. 59 illus., 1 illus. in color.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6808
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-22599-3 
320   $aIncludes bibliographical references and author index.
330   $aThis book constitutes the refereed proceedings of the 13th International Workshop of Descriptional Complexity of Formal Systems 2011, held in Limburg, Germany, in July 2011. The 21 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 54 submissions. The topics covered are automata, grammars, languages and related systems, various measures and modes of operations (e.g., determinism and nondeterminism); trade-offs between computational models and/or operations; succinctness of description of (finite) 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; Kolmogorov complexity.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6808
606   $aComputer science
606   $aSoftware engineering
606   $aMachine theory
606   $aTheory of Computation
606   $aSoftware Engineering
606   $aFormal Languages and Automata Theory
606   $aComputer Science Logic and Foundations of Programming
615  0$aComputer science.
615  0$aSoftware engineering.
615  0$aMachine theory.
615 14$aTheory of Computation.
615 24$aSoftware Engineering.
615 24$aFormal Languages and Automata Theory.
615 24$aComputer Science Logic and Foundations of Programming.
676   $a004.0151
702   $aHolzer$b Markus$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKutrib$b Martin$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPighizzini$b Giovanni$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465750903316
996   $aDescriptional Complexity of Formal Systems$91904989
997   $aUNISA