Fundamentals of Computation Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Observability and Nerode equivalence in concrete categories
3. Altmetric Badge
   Chapter 2 Some universal algebraic and model theoretic results in computer science
4. Altmetric Badge
   Chapter 3 Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems
5. Altmetric Badge
   Chapter 4 Moderately exponential bound for graph isomorphism
6. Altmetric Badge
   Chapter 5 An algebraic definition of attributed transformations
7. Altmetric Badge
   Chapter 6 Analogies of PAL and COPY
8. Altmetric Badge
   Chapter 7 Quasi-equational logic for partial algeras
9. Altmetric Badge
   Chapter 8 Homogeneity and completeness
10. Altmetric Badge
    Chapter 9 On the error correcting power of pluralism in inductive inference
11. Altmetric Badge
    Chapter 10 Equality languages and language families
12. Altmetric Badge
    Chapter 11 Extremal combinatorial problems in relational data base
13. Altmetric Badge
    Chapter 12 Specifying algebraic data types by domain equations
14. Altmetric Badge
    Chapter 13 An axiomatization of regular forests in the language of algebraic theories with iteration
15. Altmetric Badge
    Chapter 14 Fast recognition of rings and lattices
16. Altmetric Badge
    Chapter 15 A definition of the P = NP-problem in categories
17. Altmetric Badge
    Chapter 16 Generating graph languages using hypergraph grammars
18. Altmetric Badge
    Chapter 17 Lower bounds for problems defined by polynomial inequalities
19. Altmetric Badge
    Chapter 18 What is computable for abstract data types ?
20. Altmetric Badge
    Chapter 19 On strongly cube-free ω-words generated by binary morphisms
21. Altmetric Badge
    Chapter 20 On the role of selectors in selective substitution grammars
22. Altmetric Badge
    Chapter 21 Classes of functions over binary trees
23. Altmetric Badge
    Chapter 22 Mathematical structures underlying greedy algorithms
24. Altmetric Badge
    Chapter 23 Some properties of language families generated by commutative languages
25. Altmetric Badge
    Chapter 24 Isomorphism completeness for some algebraic structures
26. Altmetric Badge
    Chapter 25 Reducing algebraic tree grammars
27. Altmetric Badge
    Chapter 26 Rational cone and substitution
28. Altmetric Badge
    Chapter 27 On the regularity problem of SF-languages generated by minimal linear grammars
29. Altmetric Badge
    Chapter 28 Co-algebras as machines for the interpretations of flow diagrams
30. Altmetric Badge
    Chapter 29 Random access machines and straight-line programs
31. Altmetric Badge
    Chapter 30 On the LBA problem
32. Altmetric Badge
    Chapter 31 Dynamic algebras of programs
33. Altmetric Badge
    Chapter 32 The equivalence problem for LL- and LR-regular grammars
34. Altmetric Badge
    Chapter 33 Context-free languages of infinite words as least fixpoints
35. Altmetric Badge
    Chapter 34 Remarks on the notion of concurrency relation in the case of systems
36. Altmetric Badge
    Chapter 35 On the size of conjunctive representations of n-ary relations
37. Altmetric Badge
    Chapter 36 On subwords of formal languages
38. Altmetric Badge
    Chapter 37 First order dynamic logic with decidable proofs and workable model theory
39. Altmetric Badge
    Chapter 38 Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures
40. Altmetric Badge
    Chapter 39 Processes in Petri nets
41. Altmetric Badge
    Chapter 40 Some algebraic aspects of recognizability and rationality
42. Altmetric Badge
    Chapter 41 Pebbling and bandwidth
43. Altmetric Badge
    Chapter 42 On cellular graph-automata and second-order definable graph-properties
44. Altmetric Badge
    Chapter 43 Extensions of symmetric hom-functors to the Kleisli category
45. Altmetric Badge
    Chapter 44 A new operation between languages
46. Altmetric Badge
    Chapter 45 Logical description of computation processes
47. Altmetric Badge
    Chapter 46 An algorithm to identify slices, with applications to vector replacement systems
48. Altmetric Badge
    Chapter 47 One pebble does not suffice to search plane labyrinths
49. Altmetric Badge
    Chapter 48 About the by codings of environments induced posets [ µ z , ≤] and [ℒ z , ≤]
50. Altmetric Badge
    Chapter 49 The complexity of automata and subtheories of monadic second order arithmetics
51. Altmetric Badge
    Chapter 50 Tape complexity of word problems