Fundamentals of Computation Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Rewriting Systems with Data
3. Altmetric Badge
   Chapter 2 Spiking Neural P Systems: Some Characterizations
4. Altmetric Badge
   Chapter 3 Approximating Graphs by Graphs and Functions (Abstract)
5. Altmetric Badge
   Chapter 4 Traces, Feedback, and the Geometry of Computation (Abstract)
6. Altmetric Badge
   Chapter 5 A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings
7. Altmetric Badge
   Chapter 6 Analysis of Approximation Algorithms for k -Set Cover Using Factor-Revealing Linear Programs
8. Altmetric Badge
   Chapter 7 A Novel Information Transmission Problem and Its Optimal Solution
9. Altmetric Badge
   Chapter 8 Local Testing of Message Sequence Charts Is Difficult
10. Altmetric Badge
    Chapter 9 On Notions of Regularity for Data Languages
11. Altmetric Badge
    Chapter 10 FJMIP: A Calculus for a Modular Object Initialization
12. Altmetric Badge
    Chapter 11 Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
13. Altmetric Badge
    Chapter 12 The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
14. Altmetric Badge
    Chapter 13 Pattern Matching in Protein-Protein Interaction Graphs
15. Altmetric Badge
    Chapter 14 From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates
16. Altmetric Badge
    Chapter 15 A String-Based Model for Simple Gene Assembly
17. Altmetric Badge
    Chapter 16 On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation
18. Altmetric Badge
    Chapter 17 On Block-Wise Symmetric Signatures for Matchgates
19. Altmetric Badge
    Chapter 18 Path Algorithms on Regular Graphs
20. Altmetric Badge
    Chapter 19 Factorization of Fuzzy Automata
21. Altmetric Badge
    Chapter 20 Factorisation Forests for Infinite Words
22. Altmetric Badge
    Chapter 21 Marked Systems and Circular Splicing
23. Altmetric Badge
    Chapter 22 The Quantum Query Complexity of Algebraic Properties
24. Altmetric Badge
    Chapter 23 On the Topological Complexity of Weakly Recognizable Tree Languages
25. Altmetric Badge
    Chapter 24 Productivity of Stream Definitions
26. Altmetric Badge
    Chapter 25 Multi-dimensional Packing with Conflicts
27. Altmetric Badge
    Chapter 26 On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
28. Altmetric Badge
    Chapter 27 Efficient Parameterized Preprocessing for Cluster Editing
29. Altmetric Badge
    Chapter 28 Representing the Boolean OR Function by Quadratic Polynomials Modulo 6
30. Altmetric Badge
    Chapter 29 On the Complexity of Kings
31. Altmetric Badge
    Chapter 30 Notions of Hyperbolicity in Monoids
32. Altmetric Badge
    Chapter 31 P Systems with Adjoining Controlled Communication Rules
33. Altmetric Badge
    Chapter 32 The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
34. Altmetric Badge
    Chapter 33 Real-Time Reversible Iterative Arrays
35. Altmetric Badge
    Chapter 34 The Computational Complexity of Monotonicity in Probabilistic Networks
36. Altmetric Badge
    Chapter 35 Impossibility Results on Weakly Black-Box Hardness Amplification
37. Altmetric Badge
    Chapter 36 Maximal and Minimal Scattered Context Rewriting
38. Altmetric Badge
    Chapter 37 Strictly Deterministic CD-Systems of Restarting Automata
39. Altmetric Badge
    Chapter 38 Product Rules in Semidefinite Programming
40. Altmetric Badge
    Chapter 39 Expressive Power of LL( k ) Boolean Grammars
41. Altmetric Badge
    Chapter 40 Complexity of Pebble Tree-Walking Automata
42. Altmetric Badge
    Chapter 41 Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings
43. Altmetric Badge
    Chapter 42 Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
44. Altmetric Badge
    Chapter 43 An O (1.787 n )-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes