LEADER 05934nam 22007815 450 001 9910349410803321 005 20251225202035.0 010 $a9783319986548 010 $a3319986546 024 7 $a10.1007/978-3-319-98654-8 035 $a(CKB)4100000006098197 035 $a(DE-He213)978-3-319-98654-8 035 $a(MiAaPQ)EBC6298598 035 $a(PPN)230538223 035 $a(EXLCZ)994100000006098197 100 $a20180805d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aDevelopments in Language Theory $e22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings /$fedited by Mizuho Hoshi, Shinnosuke Seki 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (XIV, 568 p. 86 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11088 300 $aIncludes index. 311 08$a9783319986531 311 08$a3319986538 327 $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. 330 $aThis book constitutes the proceedings of the 22nd International Conference on Developments in Language Theory, DLT 2018, held in Tokyo, Japan, in September 2018. The 39 full papers presented in this volume were carefully reviewed and selected from 84 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphics, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional patterns; cryptography; concurrency; celluar automata; bio-inspired computing; quantum computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11088 606 $aComputer science 606 $aMachine theory 606 $aAlgorithms 606 $aArtificial intelligence 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aData Structures and Information Theory 606 $aMathematics of Computing 615 0$aComputer science. 615 0$aMachine theory. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 615 24$aArtificial Intelligence. 615 24$aData Structures and Information Theory. 615 24$aMathematics of Computing. 676 $a511.3 702 $aHoshi$b Mizuho$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSeki$b Shinnosuke$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349410803321 996 $aDevelopments in Language Theory$9772277 997 $aUNINA