000 03839nam a22005775i 4500
001 978-3-031-34326-1
003 DE-He213
005 20240730181158.0
007 cr nn 008mamaa
008 230529s2023 sz | s |||| 0|eng d
020 _a9783031343261
_9978-3-031-34326-1
024 7 _a10.1007/978-3-031-34326-1
_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] :
_b25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings /
_cedited by Henning Bordihn, Nicholas Tran, György Vaszil.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2023.
300 _aXVI, 197 p. 42 illus., 13 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 ;
_v13918
505 0 _aOperational State Complexity Revisited: the Contribution of Monsters and Modifiers -- Hypercubes and Isometric Words based on Swap and Mismatch Distance -- Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle -- Existential and Universal Width of Alternating Finite Automata -- On Jaffe's Pumping Lemma, Revisited -- Operational Complexity: NFA-to-DFA Trade-Off -- The Word Problem for Finitary Automaton Groups -- Separating Words Problem over Groups -- Complexity of Exclusive Nondeterministic Finite Automata -- Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound -- Pushdown and One-Counter Automata: Constant and Non-Constant Memory Usage -- Construction of a Bi-Infinite Power Free Word with a Given Factor and a Non-Recurrent Letter -- Merging two Hierarchies of External Contextual Grammars with Subregular Selection -- A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words.
520 _aThis book constitutes the proceedings of the 25th International Conference on Descriptional Complexity of Format Systems, DCFS 2023, which took place in Potsdam, Germany, in July 2023. The 14 full papers, including one invited presentation as a full paper, presented in this volume were carefully reviewed and selected from 16 submissions. The conference focus on 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.
_9123764
650 2 4 _aArtificial Intelligence.
_93407
700 1 _aBordihn, Henning.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9123765
700 1 _aTran, Nicholas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9123766
700 1 _aVaszil, György.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9123767
710 2 _aSpringerLink (Online service)
_9123768
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031343254
776 0 8 _iPrinted edition:
_z9783031343278
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13918
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-34326-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90742
_d90742