Developments in Language Theory
19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings.
Published on 13. July 2015
Book
Paperback/Softback
XXI, 440 pages
978-3-319-21499-3 (ISBN)
Description
This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and 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.
More details
Series
Edition
2015 ed.
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Research
Illustrations
71 s/w Abbildungen
XXI, 440 p. 71 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 25 mm
Weight
698 gr
ISBN-13
978-3-319-21499-3 (9783319214993)
DOI
10.1007/978-3-319-21500-6
Schweitzer Classification
Other editions
Additional editions
Igor Potapov
Developments in Language Theory
19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings.
E-Book
07/2015
Springer
€53.49
Available for download
Person
Content
Recognisable Languages over Monads.- Garside and quadratic normalisation: a survey.- Grammar-Based Tree Compression.- On decidability of intermediate levels of concatenation hierarchies.- Ergodic in Finite permutations of minimal complexity.- Diverse Palindromic Factorization is NP-Complete.- Factorization in Formal Languages.- Consensus Game Acceptors.- On the Size of Two-Way Reasonable Automata for the Liveness Problem.- Squareable Words.- Complexity Analysis: Transformation Monoids of Finite Automata.- Palindromic complexity of trees.- Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts.- Transfinite Lyndon words.- Unary patterns under permutations.- Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change.- Enumeration formulin neutral sets.- On the Density of Context-Free and Counter Languages.- Star-Continuous Kleene Omega-Algebras.- Unary probabilistic and quantum automata on promise problems.- Generalizations of Code Languages with Marginal Errors.- Minimal Reversible Deterministic Finite Automata.- Multi-Sequential Word Relations.- The Boundary of Prefix-Free Languages.- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group.- Path Checking for MTL and TPTL over Data Words.- On Distinguishing NC1 and NL.- Sur minimisation of automata.- On the Complexity of k-Piecewise Testability and the Depth of Automata.- Interval Exchange Words and the Question of Hof, Knill, and Simon.- State Complexity of Neighbourhoods and Approximate Pattern Matching.- Deterministic ordered restarting automata that compute functions.- Weight Assignment Logic.- Complexity Bounds of Constant-Space Quantum Computation.