Developments in language theory : 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings /: 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings. (2018)

• Record Type: Book
• Other Titles: DLT 2018
• Further Information: Note: Mizuho Hoshi, Shinnosuke Seki (eds.).
• Editors: Hoshi, Mizuho, 1985-; Seki, Shinnosuke
• Other Names: Conference on Developments in Language Theory, 22nd
• Contents: Block 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.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2018
• Extent: 1 online resource (xiv, 568 pages), illustrations
• Subjects: 005.13/1; Computer science; Formal languages -- Congresses; Mathematics -- Logic; Computers -- Programming -- Algorithms; Computers -- Computer Science; Computers -- Information Theory; Computers -- Data Processing; Mathematical theory of computation; Algorithms & data structures; Program concepts / learning to program; Logic design; Computer software; Electronic data processing; Data structures (Computer science); Computers -- Programming -- General; Computer programming / software development; Electronic books
• Languages: English
• ISBNs: 9783319986548; 3319986546
• Related ISBNs: 9783319986531
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed September 7, 2018).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.