LEADER 04593nam 22007095 450 001 9910349315303321 005 20230329162336.0 010 $a3-030-23247-6 024 7 $a10.1007/978-3-030-23247-4 035 $a(CKB)4100000008618196 035 $a(DE-He213)978-3-030-23247-4 035 $a(MiAaPQ)EBC5922020 035 $a(PPN)238488233 035 $a(EXLCZ)994100000008618196 100 $a20190625d2019 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDescriptional Complexity of Formal Systems $e21st IFIP WG 1.02 International Conference, DCFS 2019, Ko?ice, Slovakia, July 17?19, 2019, Proceedings /$fedited by Michal Hospodár, Galina Jirásková, Stavros Konstantinidis 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (X, 299 p. 230 illus., 5 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11612 311 $a3-030-23246-8 320 $aIncludes bibliographical references and index. 327 $aA General Framework for Sequential Grammars with Control Mechanisms -- Low-Complexity Tilings of the Plane -- Union-Freeness, Deterministic Union-Freeness and Union-Complexity -- Limited Automata: Properties, Complexity and Variants -- Nondeterministic Right One-Way Jumping Finite Automata -- State Complexity of Single-Word Pattern Matching in Regular Languages -- Square, Power, Positive Closure, and Complementation on Star-Free Languages -- Descriptional Complexity of Matrix Simple Semi-Conditional Grammars -- Regulated Tree Automata -- Generalized de Bruijn Words and the State Complexity of Conjugate Sets -- The Syntactic Complexity of Semi-Flower Languages -- Limited Nondeterminism of Input-Driven Pushdown Automata Decidability and Complexity -- Computability on Quasi-Polish Spaces -- NFA-to-DFA Trade-Off for Regular Operations -- State Complexity of Simple Splicing -- Nondeterminism Growth and State Complexity -- Descriptional Complexity of Iterated Uniform Finite State Transducers -- On Classes of Regular Languages Related to Monotone WQOs -- State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages -- Pushdown Automata and Constant Height: Decidability and Bounds -- On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances -- How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory. . 330 $aThis book constitutes the proceedings of the 21st International Conference on Descriptional Complexity of Format Systems, DCFS 2019, held in Ko?ice, Slovakia, in July 2019. The 18 full papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains 4 invited talks. They deal with all aspects of descriptional complexity and costs of description of objects in various computational models, such as Turing machines, pushdown automata, finite automata, grammars, and others. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11612 606 $aComputer science 606 $aMachine theory 606 $aArtificial intelligence 606 $aDatabase management 606 $aComputers, Special purpose 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aArtificial Intelligence 606 $aDatabase Management 606 $aSpecial Purpose and Application-Based Systems 615 0$aComputer science. 615 0$aMachine theory. 615 0$aArtificial intelligence. 615 0$aDatabase management. 615 0$aComputers, Special purpose. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aArtificial Intelligence. 615 24$aDatabase Management. 615 24$aSpecial Purpose and Application-Based Systems. 676 $a005.1015113 676 $a005.1015113 702 $aHospodár$b Michal$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJirásková$b Galina$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKonstantinidis$b Stavros$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349315303321 996 $aDescriptional Complexity of Formal Systems$91904989 997 $aUNINA