000 03730nam a22005775i 4500
001 978-3-031-13257-5
003 DE-He213
005 20240730170529.0
007 cr nn 008mamaa
008 220731s2022 sz | s |||| 0|eng d
020 _a9783031132575
_9978-3-031-13257-5
024 7 _a10.1007/978-3-031-13257-5
_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] :
_b24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings /
_cedited by Yo-Sub Han, György Vaszil.
250 _a1st ed. 2022.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2022.
300 _aXXVIII, 213 p. 47 illus., 1 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 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13439
505 0 _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.
520 _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.
650 0 _aComputer science.
_99832
650 0 _aComputer engineering.
_910164
650 0 _aComputer networks .
_931572
650 0 _aArtificial intelligence.
_93407
650 1 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aComputer Engineering and Networks.
_994196
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aComputer Engineering and Networks.
_994196
700 1 _aHan, Yo-Sub.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_994197
700 1 _aVaszil, György.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_994198
710 2 _aSpringerLink (Online service)
_994199
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031132568
776 0 8 _iPrinted edition:
_z9783031132582
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13439
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-13257-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c87031
_d87031