LEADER 04127nam  22006375  450 
001 996418213203316
005 20230329225140.0
010   $a3-030-62536-2
024 7 $a10.1007/978-3-030-62536-8
035   $a(CKB)4100000011558607
035   $a(DE-He213)978-3-030-62536-8
035   $a(MiAaPQ)EBC6386171
035   $a(PPN)252506731
035   $a(EXLCZ)994100000011558607
100   $a20201107d2020      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aDescriptional Complexity of Formal Systems$b[electronic resource] $e22nd International Conference, DCFS 2020, Vienna, Austria, August 24?26, 2020, Proceedings /$fedited by Galina Jirásková, Giovanni Pighizzini
205   $a1st ed. 2020.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020.
215   $a1 online resource (X, 245 p. 327 illus., 9 illus. in color.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12442
300   $aIncludes index.
311   $a3-030-62535-4 
327   $aMutually Accepting Capacitated Automata -- Bad pictures: some structural properties related to overlaps -- Regular Expression Length via Arithmetic Formula Complexity -- Crisp-determinization of Weighted Tree Automata over Additively Locally Finite and Past-finite Monotonic Strong Bimonoids is Decidable -- On the Power of Generalized Forbidding Insertion-Deletion Systems -- State Complexity Bounds for the Commutative Closure of Group Languages -- Multiple Concatenation and State Complexity (Extended Abstract) -- Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata -- Longer shortest strings in two-way finite automata -- Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion -- Descriptional Complexity of Winning Sets of Regular Languages -- State complexity of GF(2)-inverse and GF(2)-star on binary languages -- Complexity of Two-dimensional Rank-reducing Grammars -- Palindromic Length of Words with Many Periodic Palindromes -- Operational Complexity of Straight Line Programs for Regular Languages -- Classifying ?-Regular Aperiodic k-Partitions -- Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata -- On the Generative Power of Quasiperiods -- Insertion-Deletion Systems With Substitutions II.
330   $aThis book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID-19 crisis. The 19 full papers presented in this volume were carefully reviewed and selected from 31 submissions. 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 ;$v12442
606   $aComputer science
606   $aArtificial intelligence
606   $aMachine theory
606   $aDatabase management
606   $aComputer Science Logic and Foundations of Programming
606   $aArtificial Intelligence
606   $aFormal Languages and Automata Theory
606   $aDatabase Management
615  0$aComputer science.
615  0$aArtificial intelligence.
615  0$aMachine theory.
615  0$aDatabase management.
615 14$aComputer Science Logic and Foundations of Programming.
615 24$aArtificial Intelligence.
615 24$aFormal Languages and Automata Theory.
615 24$aDatabase Management.
676   $a005.1015113
702   $aPighizzini$b Giovanni
702   $aJira?skova?$b Galina
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996418213203316
996   $aDescriptional Complexity of Formal Systems$91904989
997   $aUNISA