1 option
Developments in Language Theory : 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings / edited by Mizuho Hoshi, Shinnosuke Seki.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 11088
- Theoretical Computer Science and General Issues, 2512-2029 ; 11088
- Language:
- English
- Subjects (All):
- Computer science.
- Machine theory.
- Algorithms.
- Artificial intelligence.
- Data structures (Computer science).
- Information theory.
- Computer science-Mathematics.
- Computer Science Logic and Foundations of Programming.
- Formal Languages and Automata Theory.
- Artificial Intelligence.
- Data Structures and Information Theory.
- Mathematics of Computing.
- Local Subjects:
- Computer Science Logic and Foundations of Programming.
- Formal Languages and Automata Theory.
- Algorithms.
- Artificial Intelligence.
- Data Structures and Information Theory.
- Mathematics of Computing.
- Physical Description:
- 1 online resource (XIV, 568 pages) : 86 illustrations
- Edition:
- 1st ed. 2018.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2018.
- System Details:
- text file PDF
- Summary:
- This 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-98654-8
- 9783319986548
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.