Developments in Language Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Factorization Forests
3. Altmetric Badge
   Chapter 2 Weighted versus Probabilistic Logics
4. Altmetric Badge
   Chapter 3 Post Correspondence Problem and Small Dimensional Matrices
5. Altmetric Badge
   Chapter 4 Size Complexity of Two-Way Finite Automata
6. Altmetric Badge
   Chapter 5 Matrix Mortality and the Černý-Pin Conjecture
7. Altmetric Badge
   Chapter 6 Developments in Language Theory
8. Altmetric Badge
   Chapter 7 Regular Languages Definable by Majority Quantifiers with Two Variables
9. Altmetric Badge
   Chapter 8 The Inclusion Problem of Context-Free Languages: Some Tractable Cases
10. Altmetric Badge
    Chapter 9 On the Complexity of Deciding Avoidability of Sets of Partial Words
11. Altmetric Badge
    Chapter 10 Closures in Formal Languages and Kuratowski’s Theorem
12. Altmetric Badge
    Chapter 11 Rich and Periodic-Like Words
13. Altmetric Badge
    Chapter 12 Traces of Control-Flow Graphs
14. Altmetric Badge
    Chapter 13 Left and Right Synchronous Relations
15. Altmetric Badge
    Chapter 14 An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
16. Altmetric Badge
    Chapter 15 Asymptotic Cellular Complexity
17. Altmetric Badge
    Chapter 16 Strongly Regular Grammars and Regular Approximation of Context-Free Languages
18. Altmetric Badge
    Chapter 17 Powers of Regular Languages
19. Altmetric Badge
    Chapter 18 Existence and Nonexistence of Descriptive Patterns
20. Altmetric Badge
    Chapter 19 On Stateless Multihead Finite Automata and Multihead Pushdown Automata
21. Altmetric Badge
    Chapter 20 On Negative Bases
22. Altmetric Badge
    Chapter 21 Developments in Language Theory
23. Altmetric Badge
    Chapter 22 Tight Bounds on the Descriptional Complexity of Regular Expressions
24. Altmetric Badge
    Chapter 23 Subshifts, Languages and Logic
25. Altmetric Badge
    Chapter 24 Magic Numbers and Ternary Alphabet
26. Altmetric Badge
    Chapter 25 The Pumping Lemma for Well-Nested Multiple Context-Free Languages
27. Altmetric Badge
    Chapter 26 The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
28. Altmetric Badge
    Chapter 27 A Game-Theoretic Characterization of Boolean Grammars
29. Altmetric Badge
    Chapter 28 Word Equations with One Unknown
30. Altmetric Badge
    Chapter 29 On Equations over Sets of Numbers and Their Limitations
31. Altmetric Badge
    Chapter 30 Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
32. Altmetric Badge
    Chapter 31 A Weighted μ -Calculus on Words
33. Altmetric Badge
    Chapter 32 Branching-Time Temporal Logics with Minimal Model Quantifiers
34. Altmetric Badge
    Chapter 33 Simulations by Time-Bounded Counter Machines
35. Altmetric Badge
    Chapter 34 Weighted Timed MSO Logics
36. Altmetric Badge
    Chapter 35 Balanced Words Having Simple Burrows-Wheeler Transform
37. Altmetric Badge
    Chapter 36 On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
38. Altmetric Badge
    Chapter 37 Definability in the Infix Order on Words
39. Altmetric Badge
    Chapter 38 Two-Sided Bounds for the Growth Rates of Power-Free Languages
40. Altmetric Badge
    Chapter 39 On the Decidability of the Equivalence for a Certain Class of Transducers
41. Altmetric Badge
    Chapter 40 Erasing in Petri Net Languages and Matrix Grammars