Fundamentals of Computation Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Rewriting, möbius functions and semi-commutations
3. Altmetric Badge
   Chapter 2 Simulations between different models of parallel computers
4. Altmetric Badge
   Chapter 3 Dense and disjunctive properties of languages
5. Altmetric Badge
   Chapter 4 The hierarchy of codes
6. Altmetric Badge
   Chapter 5 Five facets of hyperedge replacement beyond context-freeness
7. Altmetric Badge
   Chapter 6 An action structure for synchronous π-calculus
8. Altmetric Badge
   Chapter 7 AC 0 circuit complexity
9. Altmetric Badge
   Chapter 8 Pattern languages: Problems of decidability and generation
10. Altmetric Badge
    Chapter 9 General solution of mirror equation
11. Altmetric Badge
    Chapter 10 Decidability of equivalence for linear letter to letter top-down tree transducers
12. Altmetric Badge
    Chapter 11 Translations between flowchart schemes and process graphs
13. Altmetric Badge
    Chapter 12 Local equational logic
14. Altmetric Badge
    Chapter 13 Liveness of weighted circuits and the diophantine problem of Frobenius
15. Altmetric Badge
    Chapter 14 Context-free graph grammars: Separating vertex replacement from hyperedge replacement
16. Altmetric Badge
    Chapter 15 Formal languages consisting of primitive words
17. Altmetric Badge
    Chapter 16 Undecidability of the surjectivity problem for 2D cellular automata: A simplified proof
18. Altmetric Badge
    Chapter 17 Efficient interpretation of state charts
19. Altmetric Badge
    Chapter 18 Implementation of a universal unification algorithm for macro tree transducers
20. Altmetric Badge
    Chapter 19 Finding maximum convex polygons
21. Altmetric Badge
    Chapter 20 Approximations with axis-aligned rectangles (extended abstract)
22. Altmetric Badge
    Chapter 21 Vector sequence analysis and full weak safety for concurrent systems
23. Altmetric Badge
    Chapter 22 Does transitivity help? On the complexity of poset properties
24. Altmetric Badge
    Chapter 23 Generalized topological sorting in linear time
25. Altmetric Badge
    Chapter 24 Easily checked self-reducibility
26. Altmetric Badge
    Chapter 25 On the complexities of linear LL(1) and LR(1) grammars
27. Altmetric Badge
    Chapter 26 On the relation between firing sequences and processes of Petri nets
28. Altmetric Badge
    Chapter 27 Maximum covering with D cliques
29. Altmetric Badge
    Chapter 28 Monotonically labelled ordered trees and multidimensional binary trees
30. Altmetric Badge
    Chapter 29 A maximum path length pumping lemma for edge-replacement languages
31. Altmetric Badge
    Chapter 30 Regular approximations to shuffle products of context-free languages, and convergence of their generating functions
32. Altmetric Badge
    Chapter 31 The equational theory of a Boolean monad
33. Altmetric Badge
    Chapter 32 Non erasing Taring machines: a frontier between a decidable halting problem and Universality
34. Altmetric Badge
    Chapter 33 On scattered syntactic monoids
35. Altmetric Badge
    Chapter 34 Regular tree languages without unary symbols are star-free
36. Altmetric Badge
    Chapter 35 One-way cellular automata on cayley graphs
37. Altmetric Badge
    Chapter 36 ON tree pattern unification problems
38. Altmetric Badge
    Chapter 37 Structural Equivalence and ETOL grammars
39. Altmetric Badge
    Chapter 38 A hierarchy of deterministic top-down tree transformations
40. Altmetric Badge
    Chapter 39 Synthesis of O (lg n ) testable trees
41. Altmetric Badge
    Chapter 40 On the learnability of a restricted predicate formulae