LEADER 03553nam  22005175  450 
001 996464397103316
005 20230329150906.0
010   $a3-030-93489-6
024 7 $a10.1007/978-3-030-93489-7
035   $a(MiAaPQ)EBC6838931
035   $a(Au-PeEL)EBL6838931
035   $a(CKB)20275215400041
035   $a(OCoLC)1290718497
035   $a(DE-He213)978-3-030-93489-7
035   $a(PPN)259385190
035   $a(EXLCZ)9920275215400041
100   $a20211224d2021      u|             0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aDescriptional Complexity of Formal Systems$b[electronic resource] $e23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings /$fedited by Yo-Sub Han, Sang-Ki Ko
205   $a1st ed. 2021.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021.
215   $a1 online resource (210 pages)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13037
311 08$aPrint version: Han, Yo-Sub Descriptional Complexity of Formal Systems Cham : Springer International Publishing AG,c2021 9783030934880 
320   $aIncludes bibliographical references and index.
327   $aComplexity issues for the iterated h-preorders -- On the Uniform Distribution of Regular Expressions -- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets -- Sync-Maximal Permutation Groups Equal Primitive Permutation Groups -- Commutative Regular Languages with Product-Form Minimal Automata -- State Complexity Bounds for Upward and Downward Closures on Commutative Languages and Commutative Group and Commutative Aperiodic Languages -- More on the Descriptional Complexity of Compositions of Finite Automata -- Width Measures of Alternating Finite Automata -- Partial Derivative Automaton by Compressing Regular Expressions -- State Complexity of Partial Word Finite Automata -- State complexity of union and intersection on graph-walking automata -- Gray cycles of maximum length related to $k$-character substitutions -- Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems -- Disambiguation of Weighted Tree Automata -- Image-Binary Automata -- Improved constructions for succinct affine automata.
330   $aThis book constitutes the proceedings of the 23rd International Conference on Descriptional Complexity of Format Systems, DCFS 2021, which was supposed to take place in Seoul South Korea in June 2021, but the conference was canceled due to the COVID-19 crisis. The 16 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The conference focus to all aspects of descriptional complexity-the costs of description of objects in various computational models such as Turing machines, pushdown automata, finite automata or grammars.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13037
606   $aComputer science
606   $aComputer Science Logic and Foundations of Programming
615  0$aComputer science.
615 14$aComputer Science Logic and Foundations of Programming.
676   $a005.131
702   $aKo$b Sang-Ki
702   $aHan$b Yo-Sub
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996464397103316
996   $aDescriptional Complexity of Formal Systems$91904989
997   $aUNISA