1 option
Developments in Language Theory : 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013, Proceedings / edited by Marie-Pierre Beal, Olivier Carton.
SpringerLink Books Computer Science (2011-2024) Available online
SpringerLink Books Computer Science (2011-2024)- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 7907
- Theoretical Computer Science and General Issues, 2512-2029 ; 7907
- Language:
- English
- Subjects (All):
- Computer science.
- Machine theory.
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Theory of Computation.
- Formal Languages and Automata Theory.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Theory of Computation.
- Formal Languages and Automata Theory.
- Algorithms.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (XIV, 460 pages) : 46 illustrations
- Edition:
- 1st ed. 2013.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
- System Details:
- text file PDF
- Summary:
- This book constitutes the proceedings of the 17th International Conference on Developments in Language Theory, DLT 2013, held in Marne-la-Vallée, France, in June 2013. The 34 full papers presented in this volume were carefully reviewed and selected from 63 submissions. The scope of the conference includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphs, 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; cellular automata; bio-inspired computing; and quantum computing.
- Contents:
- Ultrametric Finite Automata and Turing Machines
- Recompression: Word Equations and Beyond
- Joint Spectral Characteristics: A Tale of Three Disciplines
- Unambiguous Finite Automata
- An Explicit Formula for the Intersection of Two Polynomials of Regular Languages
- Two Dimensional Prefix Codes of Pictures
- Adjacent Ordered Multi-Pushdown Systems
- Cuts in Regular Expressions
- Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem
- On the Asymptotic Abelian Complexity of Morphic Words
- Strict Bounds for Pattern Avoidance
- A Fresh Approach to Learning Register Automata
- Suffixes, Conjugates and Lyndon Words
- Extremal Words in the Shift Orbit Closure of a Morphic Sequence
- Inner Palindromic Closure
- On the Dual Post Correspondence Problem
- Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata
- A Coloring Problem for Sturmian and Episturmian Words
- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
- Operational Characterization of Scattered MCFLs
- Abelian Repetitions in Sturmian Words
- Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers
- Subword Complexity and k-Synchronization
- Some Decision Questions Concerning the Time Complexity of Language Acceptors
- Unambiguous Conjunctive Grammars over a One-Letter Alphabet
- Alternative Automata Characterization of Piecewise Testable Languages
- Finite Automata with Advice Tapes
- One-Way Multi-Head Finite Automata with Pebbles But No States
- Regular Expressions with Binding over Data Words for Querying Graph Databases
- Factorizations and Universal Automaton of Omega Languages
- Deciding Determinism of Unary Languages Is coNP-Complete
- Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
- 3-Abelian Cubes Are Avoidable on Binary Alphabets
- Repetition Avoidance in Circular Factors
- Operator Precedence ω-Languages
- New Results on Deterministic Sgraffito Automata
- On the Number of Abelian Bordered Words
- Proof of a Phase Transition in Probabilistic Cellular Automata
- Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-38771-5
- 9783642387715
- 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.