001441413 000__ 04439cam\a2200673Ii\4500
001441413 001__ 1441413
001441413 003__ OCoLC
001441413 005__ 20230309004737.0
001441413 006__ m\\\\\o\\d\\\\\\\\
001441413 007__ cr\un\nnnunnun
001441413 008__ 220104s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001441413 019__ $$a1292518351$$a1294357309
001441413 020__ $$a9783030934897$$q(electronic bk.)
001441413 020__ $$a3030934896$$q(electronic bk.)
001441413 020__ $$z9783030934880$$q(print)
001441413 0247_ $$a10.1007/978-3-030-93489-7$$2doi
001441413 035__ $$aSP(OCoLC)1290718497
001441413 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dEBLCP$$dDKU$$dOCLCO$$dDCT$$dOCLCF$$dOCLCO$$dCOM$$dOCLCO$$dOCLCQ
001441413 049__ $$aISEA
001441413 050_4 $$aQA267.3
001441413 08204 $$a005.13/1$$223
001441413 1112_ $$aDCFS (Workshop)$$n(23rd :$$d2021 :$$cOnline)
001441413 24510 $$aDescriptional complexity of formal systems :$$b23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual event, September 5, 2021, Proceedings /$$cYo-Sub Han, Sang-Ki Ko (eds.).
001441413 2463_ $$aDCFS 2021
001441413 264_1 $$aCham, Switzerland :$$bSpringer,$$c2021.
001441413 300__ $$a1 online resource (x, 201 pages) :$$billustrations (some color).
001441413 336__ $$atext$$btxt$$2rdacontent
001441413 337__ $$acomputer$$bc$$2rdamedia
001441413 338__ $$aonline resource$$bcr$$2rdacarrier
001441413 347__ $$atext file$$bPDF$$2rda
001441413 4901_ $$aLecture notes in computer science ;$$v13037
001441413 4901_ $$aLNCS sublibrary, SL 1, Theoretical computer science and general issues
001441413 500__ $$aIncludes author index.
001441413 5050_ $$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.
001441413 506__ $$aAccess limited to authorized users.
001441413 520__ $$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.
001441413 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed January 4, 2022).
001441413 650_0 $$aFormal languages$$vCongresses.
001441413 650_0 $$aMachine theory$$vCongresses.
001441413 650_0 $$aFormal methods (Computer science)$$vCongresses.
001441413 650_6 $$aLangages formels$$vCongrès.
001441413 650_6 $$aThéorie des automates$$vCongrès.
001441413 650_6 $$aMéthodes formelles (Informatique)$$vCongrès.
001441413 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001441413 655_7 $$aConference papers and proceedings.$$2lcgft
001441413 655_7 $$aActes de congrès.$$2rvmgf
001441413 655_0 $$aElectronic books.
001441413 7001_ $$aHan, Yo-Sub,$$eeditor.$$1https://orcid.org/0000-0002-7211-6657
001441413 7001_ $$aKo, Sang-Ki,$$eeditor.$$0(orcid)0000-0002-5406-5104$$1https://orcid.org/0000-0002-5406-5104
001441413 77608 $$iPrint version: $$z9783030934880
001441413 77608 $$iPrint version: $$z9783030934903
001441413 830_0 $$aLecture notes in computer science ;$$v13037.
001441413 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001441413 852__ $$bebk
001441413 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-93489-7$$zOnline Access$$91397441.1
001441413 909CO $$ooai:library.usi.edu:1441413$$pGLOBAL_SET
001441413 980__ $$aBIB
001441413 980__ $$aEBOOK
001441413 982__ $$aEbook
001441413 983__ $$aOnline
001441413 994__ $$a92$$bISE