Developments in Language Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
3. Altmetric Badge
   Chapter 2 Some New Directions and Questions in Parameterized Complexity
4. Altmetric Badge
   Chapter 3 Basic Notions of Reaction Systems
5. Altmetric Badge
   Chapter 4 A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms
6. Altmetric Badge
   Chapter 5 Algebraic and Topological Models for DNA Recombinant Processes
7. Altmetric Badge
   Chapter 6 Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet
8. Altmetric Badge
   Chapter 7 On Competence in CD Grammar Systems
9. Altmetric Badge
   Chapter 8 The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels
10. Altmetric Badge
    Chapter 9 Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages
11. Altmetric Badge
    Chapter 10 On the Maximum Coefficients of Rational Formal Series in Commuting Variables
12. Altmetric Badge
    Chapter 11 On Codes Defined by Bio-operations
13. Altmetric Badge
    Chapter 12 Avoidable Sets and Well Quasi-Orders
14. Altmetric Badge
    Chapter 13 A Ciliate Bio-operation and Language Families
15. Altmetric Badge
    Chapter 14 Semantic Shuffle on and Deletion Along Trajectories
16. Altmetric Badge
    Chapter 15 Sturmian Graphs and a Conjecture of Moser
17. Altmetric Badge
    Chapter 16 P Systems Working in the Sequential Mode on Arrays and Strings
18. Altmetric Badge
    Chapter 17 Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings
19. Altmetric Badge
    Chapter 18 The Power of Maximal Parallelism in P Systems
20. Altmetric Badge
    Chapter 19 An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
21. Altmetric Badge
    Chapter 20 On the Complexity of 2-Monotone Restarting Automata
22. Altmetric Badge
    Chapter 21 On Left-Monotone Deterministic Restarting Automata
23. Altmetric Badge
    Chapter 22 On the Computation Power of Finite Automata in Two-Dimensional Environments
24. Altmetric Badge
    Chapter 23 The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems
25. Altmetric Badge
    Chapter 24 The Boolean Closure of Linear Context-Free Languages
26. Altmetric Badge
    Chapter 25 Context-Sensitive Decision Problems in Groups
27. Altmetric Badge
    Chapter 26 Decidability and Complexity in Automatic Monoids
28. Altmetric Badge
    Chapter 27 Relating Tree Series Transducers and Weighted Tree Automata
29. Altmetric Badge
    Chapter 28 An NP-Complete Fragment of LTL
30. Altmetric Badge
    Chapter 29 From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata
31. Altmetric Badge
    Chapter 30 Words Avoiding $\frac{7}{3}$ -Powers and the Thue–Morse Morphism
32. Altmetric Badge
    Chapter 31 On the Equivalence Problem for E-Pattern Languages Over Small Alphabets
33. Altmetric Badge
    Chapter 32 Complementation of Rational Sets on Countable Scattered Linear Orderings
34. Altmetric Badge
    Chapter 33 On the Hausdorff Measure of ω-Power Languages
35. Altmetric Badge
    Chapter 34 A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages
36. Altmetric Badge
    Chapter 35 Tissue P Systems with Minimal Symport/Antiport