LEADER 03714nam 22006855 450 001 9910586630003321 005 20250602185506.0 010 $a9783031132575 010 $a3031132572 024 7 $a10.1007/978-3-031-13257-5 035 $a(CKB)5700000000114162 035 $a(MiAaPQ)EBC7076578 035 $a(Au-PeEL)EBL7076578 035 $a(PPN)264191218 035 $a(DE-He213)978-3-031-13257-5 035 $a(EXLCZ)995700000000114162 100 $a20220731d2022 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDescriptional Complexity of Formal Systems $e24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29?31, 2022, Proceedings /$fedited by Yo-Sub Han, György Vaszil 205 $a1st ed. 2022. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2022. 215 $a1 online resource (239 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v13439 300 $aIncludes index. 311 08$a9783031132568 311 08$a3031132564 327 $aThe Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages -- Ranking Binary Unlabelled Necklaces in Polynomial Time -- On the Power of Recursive Word-Functions without Concatenation -- Clusters of Repetition Roots Forming Prefix Chains -- Nearly k-Universal Words - Investigating a Part of Simon?s Congruence -- State Complexity of Binary Coded Regular Languages -- Reset Complexity and Completely Reachable Automata with Simple Idempotents -- On the Descriptional Complexity of the Direct Product of Finite Automata -- Operations on Subregular Languages and Nondeterministic State Complexity -- On Simon?s Congruence Closure of a String -- Approximate NFA Universality Motivated by Information Theory -- Lazy Regular Sensing -- State Complexity of Finite Partial Languages -- Yet Another Canonical Nondeterministic Automaton -- Union-Complexities of Kleene Plus Operation. 330 $aThis book constitutes the proceedings of the 24th International Conference on Descriptional Complexity of Format Systems, DCFS 2022, which was supposed to take place in Debrecen, Hungary in August 2022. The 14 full papers presented in this volume were carefully reviewed and selected from 17 submissions. The book also contains 4 invited talks. The conference focus to all aspects of descriptional complexity including Automata, grammars, languages, and other formal systems; various modes of operations and complexity measures. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v13439 606 $aComputer science 606 $aComputer engineering 606 $aComputer networks 606 $aArtificial intelligence 606 $aComputer Science Logic and Foundations of Programming 606 $aComputer Engineering and Networks 606 $aArtificial Intelligence 606 $aComputer Engineering and Networks 615 0$aComputer science. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aArtificial intelligence. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aComputer Engineering and Networks. 615 24$aArtificial Intelligence. 615 24$aComputer Engineering and Networks. 676 $a004.0151 676 $a005.131 702 $aHan$b Yo-Sub 702 $aVaszil$b Gyo?rgy 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910586630003321 996 $aDescriptional Complexity of Formal Systems$91904989 997 $aUNINA