000 04378nam a22006135i 4500
001 978-3-030-23247-4
003 DE-He213
005 20240423124955.0
007 cr nn 008mamaa
008 190625s2019 sz | s |||| 0|eng d
020 _a9783030232474
_9978-3-030-23247-4
024 7 _a10.1007/978-3-030-23247-4
_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] :
_b21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019, Proceedings /
_cedited by Michal Hospodár, Galina Jirásková, Stavros Konstantinidis.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aX, 299 p. 230 illus., 5 illus. in color.
_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 ;
_v11612
505 0 _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. .
520 _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. .
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aArtificial intelligence.
650 0 _aDatabase management.
650 0 _aComputers, Special purpose.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aArtificial Intelligence.
650 2 4 _aDatabase Management.
650 2 4 _aSpecial Purpose and Application-Based Systems.
700 1 _aHospodár, Michal.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aJirásková, Galina.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKonstantinidis, Stavros.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030232467
776 0 8 _iPrinted edition:
_z9783030232481
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11612
856 4 0 _uhttps://doi.org/10.1007/978-3-030-23247-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c172796
_d172796