000 | 03286nam a22005415i 4500 | ||
---|---|---|---|
001 | 978-3-642-31623-4 | ||
003 | DE-He213 | ||
005 | 20240730193717.0 | ||
007 | cr nn 008mamaa | ||
008 | 120709s2012 gw | s |||| 0|eng d | ||
020 |
_a9783642316234 _9978-3-642-31623-4 |
||
024 | 7 |
_a10.1007/978-3-642-31623-4 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aDescriptional Complexity of Formal Systems _h[electronic resource] : _b14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012, Proceedings / _cedited by Martin Kutrib, Nelma Moreira, Rogério Reis. |
250 | _a1st ed. 2012. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2012. |
|
300 |
_aX, 319 p. 23 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v7386 |
|
520 | _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. | ||
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aMachine theory. _9154259 |
|
650 | 1 | 4 |
_aTheory of Computation. _9154260 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9154261 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
700 | 1 |
_aKutrib, Martin. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9154262 |
|
700 | 1 |
_aMoreira, Nelma. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9154263 |
|
700 | 1 |
_aReis, Rogério. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9154264 |
|
710 | 2 |
_aSpringerLink (Online service) _9154265 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642316227 |
776 | 0 | 8 |
_iPrinted edition: _z9783642316241 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v7386 _9154266 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-31623-4 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c94829 _d94829 |