Mathematical Foundations of Computer Science 1991

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 44 Elimination of negation in term algebras
3. Altmetric Badge
   Chapter 45 Rewrite orderings and termination of rewrite systems
4. Altmetric Badge
   Chapter 46 On the faithfulness of formal models
5. Altmetric Badge
   Chapter 47 Models for concurrency
6. Altmetric Badge
   Chapter 48 On a hierarchy of file types and a tower of their theories
7. Altmetric Badge
   Chapter 49 Strong conjunction and intersection types
8. Altmetric Badge
   Chapter 50 Partial higher-order specifications
9. Altmetric Badge
   Chapter 51 Unification in incompletely specified theories: A case study
10. Altmetric Badge
    Chapter 52 Observing localities
11. Altmetric Badge
    Chapter 53 Abstract dynamic data types: A temporal logic approach
12. Altmetric Badge
    Chapter 54 Generating words by cellular automata
13. Altmetric Badge
    Chapter 55 Atomic refinement in process description languages
14. Altmetric Badge
    Chapter 56 Recognizable complex trace languages (abstract)
15. Altmetric Badge
    Chapter 57 Solving systems of linear diophantine equations: An algebraic approach
16. Altmetric Badge
    Chapter 58 A second-order pattern matching algorithm for the cube of typed λ-calculi
17. Altmetric Badge
    Chapter 59 The lazy call-by-value λ-calculus
18. Altmetric Badge
    Chapter 60 The limit of split n -bisimulations for CCS agents
19. Altmetric Badge
    Chapter 61 Stochastic automata and length distributions of rational languages
20. Altmetric Badge
    Chapter 62 Mathematical Foundations of Computer Science 1991
21. Altmetric Badge
    Chapter 63 Single-path Petri nets
22. Altmetric Badge
    Chapter 64 The bisection problem for graphs of degree 4 (configuring transputer systems)
23. Altmetric Badge
    Chapter 65 Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
24. Altmetric Badge
    Chapter 66 Infinite normal forms for non-linear term rewriting systems
25. Altmetric Badge
    Chapter 67 Two algorithms for approxmate string matching in static texts
26. Altmetric Badge
    Chapter 68 Efficient constructions of test sets for regular and context-free languages
27. Altmetric Badge
    Chapter 69 The complexity of the reliable connectivity problem
28. Altmetric Badge
    Chapter 70 Pattern matching in order-sorted languages
29. Altmetric Badge
    Chapter 71 Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
30. Altmetric Badge
    Chapter 72 A solution of the complement problem in associatiue-commutatiue theories
31. Altmetric Badge
    Chapter 73 A model for real-time systems
32. Altmetric Badge
    Chapter 74 On strict codes
33. Altmetric Badge
    Chapter 75 A decidable case of the semi-unification problem
34. Altmetric Badge
    Chapter 76 Maintaining dictionaries in a hierarchical memory
35. Altmetric Badge
    Chapter 77 Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ω-BRANCHING PROGRAMs
36. Altmetric Badge
    Chapter 78 CCS dynamic bisimulation is progressing
37. Altmetric Badge
    Chapter 79 Syntax and semantics of a monotonic framework for non-monotonic reasoning
38. Altmetric Badge
    Chapter 80 On the cardinality of sets of infinite trees recognizable by finite automata
39. Altmetric Badge
    Chapter 81 Extending temporal logic by explicit concurrency
40. Altmetric Badge
    Chapter 82 An extensional partial combinatory algebra based on λ-terms
41. Altmetric Badge
    Chapter 83 Once more on order-sorted algebras
42. Altmetric Badge
    Chapter 84 Composition of two semi commutations
43. Altmetric Badge
    Chapter 85 An efficient decision algorithm for the uniform semi-unification problem extended abstract
44. Altmetric Badge
    Chapter 86 Different modifications of pointer machines and their computational power