000 04429nam a22005655i 4500
001 978-3-319-19225-3
003 DE-He213
005 20200421111655.0
007 cr nn 008mamaa
008 150615s2015 gw | s |||| 0|eng d
020 _a9783319192253
_9978-3-319-19225-3
024 7 _a10.1007/978-3-319-19225-3
_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] :
_b17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings /
_cedited by Jeffrey Shallit, Alexander Okhotin.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXII, 293 p. 48 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 ;
_v9118
505 0 _aInvited Talks -- Regular Functions -- Unambiguity in Automata Theory -- Contributed Papers -- Partial Derivative Automaton for Regular Expressions with Shue -- Upper Bound on Syntactic Complexity of Suffix-Free Languages -- Nondeterministic Tree Width of Regular Languages -- Integer Complexity: Experimental and Analytical Results II -- Square on ideal, closed and free languages -- A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0,2] -- Compressibility of finite languages by grammars -- On the Complexity and Decidability of Some Problems Involving Shue -- On the Computational Complexity of Problems Related to Distinguishability Sets -- Prefix-Free Subsets of Regular Languages and Descriptional Complexity -- Transducer Descriptions of DNA Code Properties and Undecidability of Antimorphic Problems -- On Simulation Costs of Unary Limited Automata -- On some decision problems for stateless deterministic ordered restarting Automata -- Quantum queries on permutations -- Complement on Free and Ideal Languages -- Universal Disjunctive Concatenation and Star -- Quasi-Distances and Weighted Finite Automata -- The State Complexity of Permutations on Finite Languages Over Binary Alphabets -- Star-Complement-Star on Prefix-Free Languages -- Groups whose word problem is a Petri net language -- Regular realizability problems and context-free languages -- Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton -- Quantum State Complexity of Formal Languages.
520 _aThis book constitutes the refereed proceedings of the 17th International Conference on Descriptional Complexity of Formal Systems, DCFS 2015, held in Waterloo, ON, Canada, in June 2015. The 23 full papers presented  together with 2 invited talks were carefully reviewed and selected from 29 submissions. The subject of the workshop was descriptional complexity. Roughly speaking, this  field is concerned with the size of objects in various mathematical models of computation, such as finite automata, pushdown automata, and Turing machines. Descriptional complexity serves as a theoretical representation of physical realizations, such as the engineering complexity of computer software and hardware. It also models similar complexity phenomena in other areas of computer science, including unconventional computing and bioinformatics.
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 _aShallit, Jeffrey.
_eeditor.
700 1 _aOkhotin, Alexander.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319192246
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9118
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-19225-3
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c54630
_d54630