LEADER 04091nam  22007455  450 
001 9910485019703321
005 20251226200623.0
010   $a3-642-39310-1
024 7 $a10.1007/978-3-642-39310-5
035   $a(CKB)2560000000105703
035   $a(DE-He213)978-3-642-39310-5
035   $a(SSID)ssj0000936433
035   $a(PQKBManifestationID)11530910
035   $a(PQKBTitleCode)TC0000936433
035   $a(PQKBWorkID)10962358
035   $a(PQKB)10431361
035   $a(MiAaPQ)EBC3101154
035   $a(PPN)170493210
035   $a(EXLCZ)992560000000105703
100   $a20130615d2013      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aDescriptional Complexity of Formal Systems $e15th International Workshop, DCFS 2013, London, Canada, July 22-25, 2013, Proceedings /$fedited by Jürgensen, Rogério Reis
205   $a1st ed. 2013.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013.
215   $a1 online resource (X, 289 p. 56 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8031
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a3-642-39309-8 
320   $aIncludes bibliographical references and index.
330   $aThis 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8031
606   $aComputer science
606   $aMachine theory
606   $aAlgorithms
606   $aComputer science$xMathematics
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$xMathematics.
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   $a005.131
702   $aJürgensen$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aReis$b Rogério$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910485019703321
996   $aDescriptional Complexity of Formal Systems$91904989
997   $aUNINA