Developments in Language Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 On First-Order Fragments for Words and Mazurkiewicz Traces
3. Altmetric Badge
   Chapter 2 Quantitative Generalizations of Languages
4. Altmetric Badge
   Chapter 3 What Do We Know About Language Equations?
5. Altmetric Badge
   Chapter 4 Information Distance and Applications
6. Altmetric Badge
   Chapter 5 Finite Automata and the Writing of Numbers
7. Altmetric Badge
   Chapter 6 Descriptional Complexity of Nondeterministic Finite Automata
8. Altmetric Badge
   Chapter 7 From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
9. Altmetric Badge
   Chapter 8 Coding Partitions: Regularity, Maximality and Global Ambiguity
10. Altmetric Badge
    Chapter 9 Multi-letter Reversible and Quantum Finite Automata
11. Altmetric Badge
    Chapter 10 Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids
12. Altmetric Badge
    Chapter 11 The Dynamics of Cellular Automata in Shift-Invariant Topologies
13. Altmetric Badge
    Chapter 12 Two Element Unavoidable Sets of Partial Words
14. Altmetric Badge
    Chapter 13 Hairpin Finite Automata
15. Altmetric Badge
    Chapter 14 Characterizing Reduction Graphs for Gene Assembly in Ciliates
16. Altmetric Badge
    Chapter 15 2-Visibly Pushdown Automata
17. Altmetric Badge
    Chapter 16 An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression
18. Altmetric Badge
    Chapter 17 An Extension of Newton’s Method to ω -Continuous Semirings
19. Altmetric Badge
    Chapter 18 Non-constructive Methods for Finite Probabilistic Automata
20. Altmetric Badge
    Chapter 19 The Unambiguity of Segmented Morphisms
21. Altmetric Badge
    Chapter 20 Commutation of Binary Factorial Languages
22. Altmetric Badge
    Chapter 21 Inapproximability of Nondeterministic State and Transition Complexity Assuming P  ≠  NP
23. Altmetric Badge
    Chapter 22 State Complexity of Union and Intersection of Finite Languages
24. Altmetric Badge
    Chapter 23 Bisimulation Minimisation for Weighted Tree Automata
25. Altmetric Badge
    Chapter 24 Conjunctive Grammars Can Generate Non-regular Unary Languages
26. Altmetric Badge
    Chapter 25 Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet
27. Altmetric Badge
    Chapter 26 Reduced Languages as ω -Generators
28. Altmetric Badge
    Chapter 27 Avoiding Approximate Squares
29. Altmetric Badge
    Chapter 28 Duplication Roots
30. Altmetric Badge
    Chapter 29 Complexity Theory for Splicing Systems
31. Altmetric Badge
    Chapter 30 Descriptional Complexity of Bounded Context-Free Languages
32. Altmetric Badge
    Chapter 31 Definable Transductions and Weighted Logics for Texts
33. Altmetric Badge
    Chapter 32 A Star Operation for Star-Free Trace Languages
34. Altmetric Badge
    Chapter 33 Finite Automata on Unranked and Unordered DAGs
35. Altmetric Badge
    Chapter 34 On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
36. Altmetric Badge
    Chapter 35 A Local Balance Property of Episturmian Words
37. Altmetric Badge
    Chapter 36 Suffix Automata and Standard Sturmian Words
38. Altmetric Badge
    Chapter 37 Fine Hierarchy of Regular Aperiodic ω -Languages
39. Altmetric Badge
    Chapter 38 On Transition Minimality of Bideterministic Automata