Descriptional Complexity of Formal Systems

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Linear Algebra Based Bounds for One-Dimensional Cellular Automata
3. Altmetric Badge
   Chapter 2 On Restarting Automata with Window Size One
4. Altmetric Badge
   Chapter 3 Construction and SAT-Based Verification of Contextual Unfoldings
5. Altmetric Badge
   Chapter 4 The Power of Diversity
6. Altmetric Badge
   Chapter 5 Decidability and Shortest Strings in Formal Languages
7. Altmetric Badge
   Chapter 6 On the Degree of Team Cooperation in CD Grammar Systems
8. Altmetric Badge
   Chapter 7 The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata
9. Altmetric Badge
   Chapter 8 Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
10. Altmetric Badge
    Chapter 9 Geometrical Regular Languages and Linear Diophantine Equations
11. Altmetric Badge
    Chapter 10 On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems
12. Altmetric Badge
    Chapter 11 On Contextual Grammars with Subregular Selection Languages
13. Altmetric Badge
    Chapter 12 Remarks on Separating Words
14. Altmetric Badge
    Chapter 13 State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal
15. Altmetric Badge
    Chapter 14 k -Local Internal Contextual Grammars
16. Altmetric Badge
    Chapter 15 On Synchronized Multitape and Multihead Automata
17. Altmetric Badge
    Chapter 16 State Complexity of Projected Languages
18. Altmetric Badge
    Chapter 17 Note on Reversal of Binary Regular Languages
19. Altmetric Badge
    Chapter 18 State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet
20. Altmetric Badge
    Chapter 19 Kleene Theorems for Product Systems
21. Altmetric Badge
    Chapter 20 Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals
22. Altmetric Badge
    Chapter 21 State Trade-Offs in Unranked Tree Automata
23. Altmetric Badge
    Chapter 22 A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes
24. Altmetric Badge
    Chapter 23 Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity
25. Altmetric Badge
    Chapter 24 Transition Function Complexity of Finite Automata
26. Altmetric Badge
    Chapter 25 Complexity of Nondeterministic Multitape Computations Based on Crossing Sequences