001448885 000__ 03831cam\a2200589\i\4500
001448885 001__ 1448885
001448885 003__ OCoLC
001448885 005__ 20230310004302.0
001448885 006__ m\\\\\o\\d\\\\\\\\
001448885 007__ cr\cn\nnnunnun
001448885 008__ 220825s2022\\\\sz\a\\\\o\\\\\101\0\eng\d
001448885 019__ $$a1341985755
001448885 020__ $$a9783031132575$$q(electronic bk.)
001448885 020__ $$a3031132572$$q(electronic bk.)
001448885 020__ $$z9783031132568
001448885 020__ $$z3031132564
001448885 0247_ $$a10.1007/978-3-031-13257-5$$2doi
001448885 035__ $$aSP(OCoLC)1342109359
001448885 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP$$dOCLCF$$dOCLCQ
001448885 049__ $$aISEA
001448885 050_4 $$aQA267.3
001448885 08204 $$a005.13/1$$223/eng/20220825
001448885 1112_ $$aDCFS (Workshop)$$n(24th :$$d2022 :$$cDebrecen, Hungary)
001448885 24510 $$aDescriptional complexity of formal systems :$$b24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings /$$cYo-Sub Han, György Vaszil (eds.).
001448885 2463_ $$aDCFS 2022
001448885 264_1 $$aCham, Switzerland :$$bSpringer,$$c2022.
001448885 300__ $$a1 online resource :$$billustrations (black and white).
001448885 336__ $$atext$$btxt$$2rdacontent
001448885 337__ $$acomputer$$bc$$2rdamedia
001448885 338__ $$aonline resource$$bcr$$2rdacarrier
001448885 4901_ $$aLecture notes in computer science ;$$v13439
001448885 500__ $$aSelected conference papers.
001448885 500__ $$aIncludes author index.
001448885 5050_ $$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 Simons 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 Simons 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.
001448885 506__ $$aAccess limited to authorized users.
001448885 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.
001448885 588__ $$aDescription based on print version record.
001448885 650_0 $$aFormal languages$$vCongresses.
001448885 650_0 $$aMachine theory$$vCongresses.
001448885 650_0 $$aFormal methods (Computer science)$$vCongresses.
001448885 655_0 $$aElectronic books.
001448885 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001448885 7001_ $$aHan, Yo-Sub,$$eeditor.$$1https://isni.org/isni/0000000463421865
001448885 7001_ $$aVaszil, György,$$eeditor.$$1https://isni.org/isni/0000000403567408
001448885 77608 $$iPrint version:$$aDCFS (Workshop) (24th : 2022 : Debrecen, Hungary), creator.$$tDescriptional complexity of formal systems.$$dCham : Springer, 2022$$z9783031132568$$w(OCoLC)1338677615
001448885 830_0 $$aLecture notes in computer science ;$$v13439.
001448885 852__ $$bebk
001448885 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-13257-5$$zOnline Access$$91397441.1
001448885 909CO $$ooai:library.usi.edu:1448885$$pGLOBAL_SET
001448885 980__ $$aBIB
001448885 980__ $$aEBOOK
001448885 982__ $$aEbook
001448885 983__ $$aOnline
001448885 994__ $$a92$$bISE