Developments in Language Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Computational Processes in Living Cells: Gene Assembly in Ciliates
3. Altmetric Badge
   Chapter 2 Experimental Quantum Computation with Molecules
4. Altmetric Badge
   Chapter 3 Efficient Transformations from Regular Expressions to Finite Automata
5. Altmetric Badge
   Chapter 4 Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators
6. Altmetric Badge
   Chapter 5 A Remark about Quadratic Trace Equations
7. Altmetric Badge
   Chapter 6 Infinite Snake Tiling Problems
8. Altmetric Badge
   Chapter 7 Decision Problems for Linear and Circular Splicing Systems
9. Altmetric Badge
   Chapter 8 Finite Automata Models of Quantized Systems: Conceptual Status and Outlook
10. Altmetric Badge
    Chapter 9 Automata on Linear Orderings
11. Altmetric Badge
    Chapter 10 Some Properties of Ciliate Bio-operations
12. Altmetric Badge
    Chapter 11 On the Descriptional Complexity of Some Variants of Lindenmayer Systems
13. Altmetric Badge
    Chapter 12 Carriers and Counters
14. Altmetric Badge
    Chapter 13 On the Separation between k -Party and ( k - 1)-Party Nondeterministic Message Complexities
15. Altmetric Badge
    Chapter 14 Unary Language Operations and Their Nondeterministic State Complexity
16. Altmetric Badge
    Chapter 15 Constructing Infinite Words of Intermediate Complexity
17. Altmetric Badge
    Chapter 16 A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines
18. Altmetric Badge
    Chapter 17 Undecidability of Weak Bisimilarity for PA-Processes
19. Altmetric Badge
    Chapter 18 Improved Bounds on the Number of Automata Accepting Finite Languages
20. Altmetric Badge
    Chapter 19 Roots and Powers of Regular Languages
21. Altmetric Badge
    Chapter 20 Innermost Termination of Context-Sensitive Rewriting
22. Altmetric Badge
    Chapter 21 A Unique Structure of Two-Generated Binary Equality Sets
23. Altmetric Badge
    Chapter 22 On Deterministic Finite Automata and Syntactic Monoid Size
24. Altmetric Badge
    Chapter 23 An Inverse Automata Algorithm for Recognizing 2-Collapsing Words
25. Altmetric Badge
    Chapter 24 Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z - Σ * -Automata
26. Altmetric Badge
    Chapter 25 Some Remarks on Asynchronous Automata
27. Altmetric Badge
    Chapter 26 Tiling Systems over Infinite Pictures and Their Acceptance Conditions
28. Altmetric Badge
    Chapter 27 The Average Lengths of the Factors of the Standard Factorization of Lyndon Words
29. Altmetric Badge
    Chapter 28 Circular Words Avoiding Patterns
30. Altmetric Badge
    Chapter 29 Safety Verification for Two-Way Finite Automata with Monotonic Counters
31. Altmetric Badge
    Chapter 30 An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton
32. Altmetric Badge
    Chapter 31 On the Structure of Graphic DLI-Sets
33. Altmetric Badge
    Chapter 32 Finite Completion of Comma-Free Codes. Part I
34. Altmetric Badge
    Chapter 33 On a Family of Codes with Bounded Deciphering Delay
35. Altmetric Badge
    Chapter 34 Abstract Families of Graphs
36. Altmetric Badge
    Chapter 35 Automaton Representation of Linear Conjunctive Languages
37. Altmetric Badge
    Chapter 36 On-Line Odometers for Two-Sided Symbolic Dynamical Systems
38. Altmetric Badge
    Chapter 37 Characteristic Semigroups of Directable Automata