Advertisement

Developments in Language Theory

19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings.

  • Igor Potapov
Conference proceedings DLT 2015

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9168)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9168)

Table of contents

  1. Front Matter
    Pages I-XXI
    PDF
  2. Recognisable Languages over Monads
    Mikołaj Bojańczyk
    Pages 1-13
  3. Garside and Quadratic Normalisation: A Survey
    Patrick Dehornoy
    Pages 14-45
  4. Grammar-Based Tree Compression
    Markus Lohrey
    Pages 46-57
  5. On Decidability of Intermediate Levels of Concatenation Hierarchies
    Jorge Almeida, Jana Bartoňová, Ondřej Klíma, Michal Kunc
    Pages 58-70
  6. Ergodic Infinite Permutations of Minimal Complexity
    Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
    Pages 71-84
  7. Diverse Palindromic Factorization Is NP-complete
    Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piątkowski et al.
    Pages 85-96
  8. Factorization in Formal Languages
    Paul C. Bell, Daniel Reidenbach, Jeffrey Shallit
    Pages 97-107
  9. Consensus Game Acceptors
    Dietmar Berwanger, Marie van den Bogaard
    Pages 108-119
  10. On the Size of Two-Way Reasonable Automata for the Liveness Problem
    Maria Paola Bianchi, Juraj Hromkovič, Ivan Kováč
    Pages 120-131
  11. Squareable Words
    Francine Blanchet-Sadri, Abraham Rashin
    Pages 132-142
  12. Complexity Analysis: Transformation Monoids of Finite Automata
    Christian Brandl, Hans Ulrich Simon
    Pages 143-154
  13. Palindromic Complexity of Trees
    Srečko Brlek, Nadia Lafrenière, Xavier Provençal
    Pages 155-166
  14. Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts
    Marie-Pierre Béal, Pavel Heller
    Pages 167-178
  15. Transfinite Lyndon Words
    Luc Boasson, Olivier Carton
    Pages 179-190
  16. Unary Patterns with Permutations
    James Currie, Florin Manea, Dirk Nowotka
    Pages 191-202
  17. Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
    Christopher Czyba, Christopher Spinrath, Wolfgang Thomas
    Pages 203-214
  18. Enumeration Formulæ in Neutral Sets
    Francesco Dolce, Dominique Perrin
    Pages 215-227
  19. On the Density of Context-Free and Counter Languages
    Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
    Pages 228-239
  20. *-Continuous Kleene \(\omega \)-Algebras
    Zoltán Ésik, Uli Fahrenberg, Axel Legay
    Pages 240-251
  21. Unary Probabilistic and Quantum Automata on Promise Problems
    Aida Gainutdinova, Abuzer Yakaryılmaz
    Pages 252-263
  22. Generalizations of Code Languages with Marginal Errors
    Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
    Pages 264-275
  23. Minimal Reversible Deterministic Finite Automata
    Markus Holzer, Sebastian Jakobi, Martin Kutrib
    Pages 276-287
  24. Multi-sequential Word Relations
    Ismaël Jecker, Emmanuel Filiot
    Pages 288-299
  25. The Boundary of Prefix-Free Languages
    Jozef Jirásek , Galina Jirásková
    Pages 300-312
  26. A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
    Ines Klimann, Matthieu Picantin, Dmytro Savchuk
    Pages 313-325
  27. Path Checking for MTL and TPTL over Data Words
    Shiguang Feng, Markus Lohrey, Karin Quaas
    Pages 326-339
  28. On Distinguishing NC\(^1\) and NL
    Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig
    Pages 340-351
  29. Surminimisation of Automata
    Victor Marsault
    Pages 352-363
  30. On the Complexity of k-Piecewise Testability and the Depth of Automata
    Tomáš Masopust, Michaël Thomazo
    Pages 364-376
  31. Interval Exchange Words and the Question of Hof, Knill, and Simon
    Zuzana Masáková, Edita Pelantová, Štěpán Starosta
    Pages 377-388
  32. State Complexity of Neighbourhoods and Approximate Pattern Matching
    Timothy Ng, David Rappaport, Kai Salomaa
    Pages 389-400
  33. Deterministic Ordered Restarting Automata that Compute Functions
    Friedrich Otto, Kent Kwee
    Pages 401-412
  34. Weight Assignment Logic
    Vitaly Perevoshchikov
    Pages 413-425
  35. Complexity Bounds of Constant-Space Quantum Computation
    Tomoyuki Yamakami
    Pages 426-438
  36. Back Matter
    Pages 439-440
    PDF

About these proceedings

Introduction

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.

Keywords

algebraic language theory automata theory bio-inspired computing cellular automata complexity theory concurrency context-free languages cryptography decidability finite automata formal languages grammars multidimensional patterns pushdown automata quantum computing regular languages symbolic dynamics transducers trees and graphs variable length codes

Editors and affiliations

  • Igor Potapov
    • 1
  1. 1.University of LiverpoolLiverpoolUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-21500-6
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-21499-3
  • Online ISBN 978-3-319-21500-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications