LEADER 03388nam  22006135  450 
001 996465322603316
005 20230329160716.0
010   $a3-642-31623-9
024 7 $a10.1007/978-3-642-31623-4
035   $a(CKB)3400000000085735
035   $a(SSID)ssj0000745910
035   $a(PQKBManifestationID)11421403
035   $a(PQKBTitleCode)TC0000745910
035   $a(PQKBWorkID)10860039
035   $a(PQKB)11692144
035   $a(DE-He213)978-3-642-31623-4
035   $a(MiAaPQ)EBC3069844
035   $a(PPN)16831987X
035   $a(EXLCZ)993400000000085735
100   $a20120709d2012      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aDescriptional Complexity of Formal Systems$b[electronic resource] $e14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, Proceedings /$fedited by Martin Kutrib, Nelma Moreira, Rogério Reis
205   $a1st ed. 2012.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012.
215   $a1 online resource (X, 319 p. 23 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7386
300   $aInternational conference proceedings.
311   $a3-642-31622-0 
320   $aIncludes bibliographical references and author index.
330   $aThis book constitutes the refereed proceedings of the 14th International Workshop of Descriptional Complexity of Formal Systems 2012, held in Braga, Portugal, in July 2012. The 20 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 33 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 ;$v7386
606   $aComputer science
606   $aMachine theory
606   $aTheory of Computation
606   $aFormal Languages and Automata Theory
606   $aComputer Science Logic and Foundations of Programming
615  0$aComputer science.
615  0$aMachine theory.
615 14$aTheory of Computation.
615 24$aFormal Languages and Automata Theory.
615 24$aComputer Science Logic and Foundations of Programming.
676   $a004.0151
702   $aKutrib$b Martin$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMoreira$b Nelma$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aReis$b Rogério$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aDCFS (Workshop)
906   $aBOOK
912   $a996465322603316
996   $aDescriptional Complexity of Formal Systems$91904989
997   $aUNISA