Developments in Language Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Recognisable Languages over Monads
3. Altmetric Badge
   Chapter 2 Garside and Quadratic Normalisation: A Survey
4. Altmetric Badge
   Chapter 3 Grammar-Based Tree Compression
5. Altmetric Badge
   Chapter 4 On Decidability of Intermediate Levels of Concatenation Hierarchies
6. Altmetric Badge
   Chapter 5 Ergodic Infinite Permutations of Minimal Complexity
7. Altmetric Badge
   Chapter 6 Diverse Palindromic Factorization Is NP-complete
8. Altmetric Badge
   Chapter 7 Factorization in Formal Languages
9. Altmetric Badge
   Chapter 8 Consensus Game Acceptors
10. Altmetric Badge
    Chapter 9 On the Size of Two-Way Reasonable Automata for the Liveness Problem
11. Altmetric Badge
    Chapter 10 Squareable Words
12. Altmetric Badge
    Chapter 11 Complexity Analysis: Transformation Monoids of Finite Automata
13. Altmetric Badge
    Chapter 12 Palindromic Complexity of Trees
14. Altmetric Badge
    Chapter 13 Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts
15. Altmetric Badge
    Chapter 14 Transfinite Lyndon Words
16. Altmetric Badge
    Chapter 15 Unary Patterns with Permutations
17. Altmetric Badge
    Chapter 16 Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
18. Altmetric Badge
    Chapter 17 Enumeration Formulæ in Neutral Sets
19. Altmetric Badge
    Chapter 18 On the Density of Context-Free and Counter Languages
20. Altmetric Badge
    Chapter 19 *-Continuous Kleene $$\omega $$ ω -Algebras
21. Altmetric Badge
    Chapter 20 Unary Probabilistic and Quantum Automata on Promise Problems
22. Altmetric Badge
    Chapter 21 Generalizations of Code Languages with Marginal Errors
23. Altmetric Badge
    Chapter 22 Minimal Reversible Deterministic Finite Automata
24. Altmetric Badge
    Chapter 23 Multi-sequential Word Relations
25. Altmetric Badge
    Chapter 24 The Boundary of Prefix-Free Languages
26. Altmetric Badge
    Chapter 25 A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
27. Altmetric Badge
    Chapter 26 Path Checking for MTL and TPTL over Data Words
28. Altmetric Badge
    Chapter 27 On Distinguishing NC $$^1$$ 1 and NL
29. Altmetric Badge
    Chapter 28 Surminimisation of Automata
30. Altmetric Badge
    Chapter 29 On the Complexity of k-Piecewise Testability and the Depth of Automata
31. Altmetric Badge
    Chapter 30 Interval Exchange Words and the Question of Hof, Knill, and Simon
32. Altmetric Badge
    Chapter 31 State Complexity of Neighbourhoods and Approximate Pattern Matching
33. Altmetric Badge
    Chapter 32 Deterministic Ordered Restarting Automata that Compute Functions
34. Altmetric Badge
    Chapter 33 Weight Assignment Logic
35. Altmetric Badge
    Chapter 34 Complexity Bounds of Constant-Space Quantum Computation