000 | 03937nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-319-09704-6 | ||
003 | DE-He213 | ||
005 | 20200421112236.0 | ||
007 | cr nn 008mamaa | ||
008 | 140711s2014 gw | s |||| 0|eng d | ||
020 |
_a9783319097046 _9978-3-319-09704-6 |
||
024 | 7 |
_a10.1007/978-3-319-09704-6 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYZG _2bicssc |
|
072 | 7 |
_aCOM037000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aDescriptional Complexity of Formal Systems _h[electronic resource] : _b16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings / _cedited by Helmut J�urgensen, Juhani Karhum�aki, Alexander Okhotin. |
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2014. |
|
300 |
_aXII, 366 p. 59 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8614 |
|
505 | 0 | _aAutomata, grammars, languages and other formal systems -- Various modes of operation and complexity measures -- Trade-offs between computational models and modes of operation -- Succinctness of description of 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 -- Complexity aspects of combinatorics on words -- Kolmogorov complexity. | |
520 | _aThis book constitutes the refereed proceedings of the 16th International Conference on Descriptional Complexity of Formal Systems, DCFS 2014, held in Turku, Finland, in August 2014. The 27 full papers presented were carefully reviewed and selected from 35 submissions. The conference dealt with the following topics: Automata, grammars, languages and other formal systems; various modes of operation and complexity measures; trade-offs between computational models and modes of operation; succinctness of description of 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; complexity aspects of combinatorics on words; Kolmogorov complexity. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputers. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aComputer logic. | |
650 | 0 | _aMathematical logic. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aJ�urgensen, Helmut. _eeditor. |
|
700 | 1 |
_aKarhum�aki, Juhani. _eeditor. |
|
700 | 1 |
_aOkhotin, Alexander. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783319097039 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8614 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-09704-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c58267 _d58267 |