Computation Theory

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 An algorithmic interface structure for pascal compilers
3. Altmetric Badge
   Chapter 2 Nonuniform complexity classes, decision graphs and homological properties of posets
4. Altmetric Badge
   Chapter 3 On the control of concurrent systems by restrictions of the state behaviour
5. Altmetric Badge
   Chapter 4 From domino tilings to a new model of computation
6. Altmetric Badge
   Chapter 5 Nondeterministic Propositional Dynamic Logic with intersection is decidable
7. Altmetric Badge
   Chapter 6 A note on selection networks
8. Altmetric Badge
   Chapter 7 Correctness of inconsistent theories with notions of feasibility
9. Altmetric Badge
   Chapter 8 On the log-space reducibility among array languages /preliminary version/
10. Altmetric Badge
    Chapter 9 Non-uniformity of dynamic logic
11. Altmetric Badge
    Chapter 10 Model theory of propositional logics of programs, some open problems
12. Altmetric Badge
    Chapter 11 Some results on decision trees with relations to computational trees
13. Altmetric Badge
    Chapter 12 Propositional calculi of term satisfiability and process logics
14. Altmetric Badge
    Chapter 13 On the effectiveness of some operations on algorithms
15. Altmetric Badge
    Chapter 14 Concatenation of program modules an algebraic approach to the semantic and implementation problems
16. Altmetric Badge
    Chapter 15 Regular expressions for infinite trees and a standard form of automata
17. Altmetric Badge
    Chapter 16 Equational μ-calculus
18. Altmetric Badge
    Chapter 17 A logic of indiscernibility relations
19. Altmetric Badge
    Chapter 18 Rough sets and decision tables
20. Altmetric Badge
    Chapter 19 On learning — a rough set approach
21. Altmetric Badge
    Chapter 20 A methodology for improving parallel programs by adding communications
22. Altmetric Badge
    Chapter 21 Extension of PDL and consequence relations
23. Altmetric Badge
    Chapter 22 Rough-sets based learning systems
24. Altmetric Badge
    Chapter 23 Theories of interacting stacks
25. Altmetric Badge
    Chapter 24 Rough concepts logic
26. Altmetric Badge
    Chapter 25 An equivalence between indiscernibility relations in information systems and a fragment of intuitionistic logic
27. Altmetric Badge
    Chapter 26 On the recognition of context-free languages
28. Altmetric Badge
    Chapter 27 On multi-valued homomorphisms
29. Altmetric Badge
    Chapter 28 Traces and semiwords
30. Altmetric Badge
    Chapter 29 Deadlock prediction in linear systems
31. Altmetric Badge
    Chapter 30 Propositional dynamic logics with counters and stacks
32. Altmetric Badge
    Chapter 31 Transition graphs semantics and languages
33. Altmetric Badge
    Chapter 32 On the implementation of CSP mechanisms in loglan