000850643 000__ 04695cam\a2200541Ii\4500
000850643 001__ 850643
000850643 005__ 20230306144950.0
000850643 006__ m\\\\\o\\d\\\\\\\\
000850643 007__ cr\cn\nnnunnun
000850643 008__ 180907s2018\\\\sz\a\\\\o\\\\\101\0\eng\d
000850643 019__ $$a1050604531$$a1055585898
000850643 020__ $$a9783319986548$$q(electronic book)
000850643 020__ $$a3319986546$$q(electronic book)
000850643 020__ $$z9783319986531
000850643 020__ $$z3319986538
000850643 0247_ $$a10.1007/978-3-319-98654-8$$2doi
000850643 035__ $$aSP(OCoLC)on1050994611
000850643 035__ $$aSP(OCoLC)1050994611$$z(OCoLC)1050604531$$z(OCoLC)1055585898
000850643 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dOCLCO$$dNLE$$dYDX$$dUPM$$dOCLCF
000850643 049__ $$aISEA
000850643 050_4 $$aQA267.3
000850643 08204 $$a005.13/1$$223
000850643 1112_ $$aConference on Developments in Language Theory$$n(22nd :$$d2018 :$$cTokyo, Japan)
000850643 24510 $$aDevelopments in language theory :$$b22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings /$$cMizuho Hoshi, Shinnosuke Seki (editors).
000850643 2463_ $$aDLT 2018
000850643 264_1 $$aCham, Switzerland :$$bSpringer,$$c2018.
000850643 300__ $$a1 online resource (xiv, 568 pages) :$$billustrations.
000850643 336__ $$atext$$btxt$$2rdacontent
000850643 337__ $$acomputer$$bc$$2rdamedia
000850643 338__ $$aonline resource$$bcr$$2rdacarrier
000850643 347__ $$atext file$$bPDF$$2rda
000850643 4901_ $$aLecture notes in computer science ;$$v11088
000850643 4901_ $$aLNCS sublibrary. SL 1, Theoretical computer science and general issues
000850643 500__ $$aInternational conference proceedings.
000850643 500__ $$aIncludes author index.
000850643 5050_ $$aBlock sorting-based transformations on words: beyond the magic BWT -- The Runs Theorem and Beyond -- A Brief Excursion to Parity Games -- A tale of conjunctive grammars -- Groups, languages and dendric shifts -- Some Open Problems in Polyomino Tilings -- Weak Cost Register Automata are Still Powerful -- From Two-Way Transducers to Regular Function Expressions -- Decidability of Right One-Way Jumping Finite Automata -- Additive Number Theory via Approximation by Regular Languages -- Tree-to-graph transductions with scope -- A Characterization of Completely Reachable Automata -- Inequalities for one-step products -- On the commutative equivalence of context-free languages -- Simon's theorem for scattered words -- The Synchronizing Probability Function for Primitive Sets of Matrices -- Recognizability for automata -- Site-Directed Deletion -- Counting Subwords and Regular Languages -- Deque languages, automata and planar graphs -- A General Approach to State Complexity of Operations: Formalization and Limitations -- On Matching Generalised Repetitive Patterns -- Intersection Non-Emptiness and Hardness within Polynomial Time -- Complexity of decision problems on totally rigid acyclic tree grammars -- A Pattern Logic for Automata with Outputs -- The Intersection Problem for Finite Semigroups -- On Completely Reachable Automata and Subset Reachability -- On Minimal Grammar Problems for Finite Languages -- Reversible Pushdown Transducers -- Two-way Automata and One-Tape Machines: Read Only versus Linear Time -- Dynamics of the Independence Number and Automata Synchronization -- Closest Substring Problems for Regular Languages -- Computational Complexity of Decision Problems on Self-Verifying Finite Automata -- Generalizations of Checking Stack Automata: Characterizations and Hierarchies -- On Counting Functions of Languages -- Towards exact state complexity bounds for input-driven pushdown automata -- On Abelian Subshifts -- Reachability Problems in Nondeterministic Polynomial Maps on the Integers -- Projection for Büchi Tree Automata with Constraints between Siblings -- The Computational Power of Parsing Expression Grammars -- On finitely ambiguous Büchi automata -- Uniformization Problem for Variants of First Order Logic over Finite Words -- On deterministic ordered restart-delete automata -- Complementation of Finitely Ambiguous Büchi Automata -- A Structural Lemma for Deterministic Context-Free Languages.
000850643 506__ $$aAccess limited to authorized users.
000850643 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 7, 2018).
000850643 650_0 $$aFormal languages$$vCongresses.
000850643 7001_ $$aHoshi, Mizuho,$$d1985-$$eeditor.
000850643 7001_ $$aSeki, Shinnosuke,$$eeditor.
000850643 77608 $$iPrint version: $$z3319986538$$z9783319986531$$w(OCoLC)1043878842
000850643 830_0 $$aLecture notes in computer science ;$$v11088.
000850643 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000850643 852__ $$bebk
000850643 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-98654-8$$zOnline Access$$91397441.1
000850643 909CO $$ooai:library.usi.edu:850643$$pGLOBAL_SET
000850643 980__ $$aEBOOK
000850643 980__ $$aBIB
000850643 982__ $$aEbook
000850643 983__ $$aOnline
000850643 994__ $$a92$$bISE