Lecture notes in computer science, 7907.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
GENERAL NOTES
Text of Note
International conference proceedings.Includes author index.
CONTENTS NOTE
Text of Note
Invited Talks. Ultrametric Finite Automata and Turing Machines / Rūsiņš Freivalds --; Recompression: Word Equations and Beyond / Artur Jeż --; Joint Spectral Characteristics: A Tale of Three Disciplines / Raphaël M. Jungers --; Unambiguous Finite Automata / Christof Löding --; An Explicit Formula for the Intersection of Two Polynomials of Regular Languages / Jean-Éric Pin. Regular Papers. Two Dimensional Prefix Codes of Pictures / Marcella Anselmo, Dora Giammarresi, Maria Madonia --; Adjacent Ordered Multi-Pushdown Systems / Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan --; Cuts in Regular Expressions / Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce Watson --; Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem / Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro --; On the Asymptotic Abelian Complexity of Morphic Words / Francine Blanchet-Sadri, Nathan Fox --; Strict Bounds for Pattern Avoidance / Francine Blanchet-Sadri, Brent Woodhouse --; A Fresh Approach to Learning Register Automata / Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege --; Suffixes, Conjugates and Lyndon Words / Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino --; Extremal Words in the Shift Orbit Closure of a Morphic Sequence / James D. Currie, Narad Rampersad, Kalle Saari --; Inner Palindromic Closure / Jürgen Dassow, Florin Manea, Robert Mercaş, Mike Müller --; On the Dual Post Correspondence Problem / Joel D. Day, Daniel Reidenbach, Johannes C. Schneider.
SUMMARY OR ABSTRACT
Text of Note
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.