001469976 000__ 04302cam\\22006497i\4500
001469976 001__ 1469976
001469976 003__ OCoLC
001469976 005__ 20230803003356.0
001469976 006__ m\\\\\o\\d\\\\\\\\
001469976 007__ cr\un\nnnunnun
001469976 008__ 230626s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001469976 020__ $$a9783031343261$$q(electronic bk.)
001469976 020__ $$a3031343263$$q(electronic bk.)
001469976 020__ $$z9783031343254
001469976 0247_ $$a10.1007/978-3-031-34326-1$$2doi
001469976 035__ $$aSP(OCoLC)1385982029
001469976 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dEBLCP$$dOCLCF$$dYDX
001469976 049__ $$aISEA
001469976 050_4 $$aQA267.3$$b.D34 2023
001469976 08204 $$a005.13/1$$223/eng/20230626
001469976 1112_ $$aDCFS (Workshop)$$n(25th :$$d2023 :$$cPotsdam, Germany)
001469976 24510 $$aDescriptional complexity of formal systems :$$b25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings /$$cHenning Bordihn, Nicholas Tran, György Vaszil, editors.
001469976 2463_ $$aDCFS 2023
001469976 264_1 $$aCham :$$bSpringer,$$c[2023]
001469976 300__ $$a1 online resource (xvi, 197 pages) :$$billustrations (some color).
001469976 336__ $$atext$$btxt$$2rdacontent
001469976 337__ $$acomputer$$bc$$2rdamedia
001469976 338__ $$aonline resource$$bcr$$2rdacarrier
001469976 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v13918
001469976 500__ $$aIncludes author index.
001469976 5050_ $$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.
001469976 506__ $$aAccess limited to authorized users.
001469976 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.
001469976 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed June 26, 2023).
001469976 650_0 $$aFormal languages$$vCongresses.
001469976 650_0 $$aMachine theory$$vCongresses.
001469976 650_0 $$aFormal methods (Computer science)$$vCongresses.
001469976 655_0 $$aElectronic books.
001469976 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001469976 7001_ $$aBordihn, Henning,$$eeditor.$$1https://orcid.org/0000-0003-1317-2939
001469976 7001_ $$aTran, Nicholas,$$eeditor.$$0(orcid)0000-0002-3164-4330$$1https://orcid.org/0000-0002-3164-4330
001469976 7001_ $$aVaszil, György,$$eeditor.$$1https://orcid.org/0000-0003-1213-8616
001469976 830_0 $$aLecture notes in computer science ;$$v13918.$$x1611-3349
001469976 852__ $$bebk
001469976 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-34326-1$$zOnline Access$$91397441.1
001469976 909CO $$ooai:library.usi.edu:1469976$$pGLOBAL_SET
001469976 980__ $$aBIB
001469976 980__ $$aEBOOK
001469976 982__ $$aEbook
001469976 983__ $$aOnline
001469976 994__ $$a92$$bISE