000 04331nam a22006135i 4500
001 978-3-319-09704-6
003 DE-He213
005 20240730172356.0
007 cr nn 008mamaa
008 140711s2014 sz | 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 _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] :
_b16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014, Proceedings /
_cedited by Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin.
250 _a1st ed. 2014.
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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_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.
_99832
650 0 _aMachine theory.
_9103327
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aTheory of Computation.
_9103330
650 2 4 _aFormal Languages and Automata Theory.
_9103333
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aJürgensen, Helmut.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9103334
700 1 _aKarhumäki, Juhani.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9103336
700 1 _aOkhotin, Alexander.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9103337
710 2 _aSpringerLink (Online service)
_9103339
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319097039
776 0 8 _iPrinted edition:
_z9783319097053
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8614
_9103340
856 4 0 _uhttps://doi.org/10.1007/978-3-319-09704-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c88251
_d88251