LEADER 05202nam 22007935 450 001 996198526903316 005 20230223014411.0 010 $a3-319-19225-6 024 7 $a10.1007/978-3-319-19225-3 035 $a(CKB)3710000000436858 035 $a(SSID)ssj0001558488 035 $a(PQKBManifestationID)16183742 035 $a(PQKBTitleCode)TC0001558488 035 $a(PQKBWorkID)14819484 035 $a(PQKB)10464862 035 $a(DE-He213)978-3-319-19225-3 035 $a(MiAaPQ)EBC6283682 035 $a(MiAaPQ)EBC5586552 035 $a(Au-PeEL)EBL5586552 035 $a(OCoLC)911616703 035 $a(PPN)186399243 035 $a(EXLCZ)993710000000436858 100 $a20150615d2015 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDescriptional Complexity of Formal Systems$b[electronic resource] $e17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings /$fedited by Jeffrey Shallit, Alexander Okhotin 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XII, 293 p. 48 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9118 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-19224-8 320 $aIncludes bibliographical references and index. 327 $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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9118 606 $aComputer science 606 $aMachine theory 606 $aAlgorithms 606 $aComputer science?Mathematics 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?Mathematics. 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 $a004.0151 702 $aShallit$b Jeffrey$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aOkhotin$b Alexander$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996198526903316 996 $aDescriptional Complexity of Formal Systems$91904989 997 $aUNISA