Mathematical Foundations of Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 661 Sequential functions and generalized Moore and Mealy automata
3. Altmetric Badge
   Chapter 662 Mathematical methods of the theory of stochastic automata
4. Altmetric Badge
   Chapter 663 On the quasi-controllability of automata
5. Altmetric Badge
   Chapter 664 Models for analysis of races in sequential networks
6. Altmetric Badge
   Chapter 665 Factorizations, congruences, and the decomposition of automata and systems
7. Altmetric Badge
   Chapter 666 On the periodic sum and extensions of finite automata
8. Altmetric Badge
   Chapter 667 Finite branching automata: automata theory motivated by problem solving
9. Altmetric Badge
   Chapter 668 On configurations in cellular automata
10. Altmetric Badge
    Chapter 669 Finite automata acceptation of infinite sequences
11. Altmetric Badge
    Chapter 670 R-fuzzy automata with a time-variant structure
12. Altmetric Badge
    Chapter 671 Functions computable in the limit by probabilistic machines
13. Altmetric Badge
    Chapter 672 Some properties of limit recursive functions
14. Altmetric Badge
    Chapter 673 On some approximation problems of continuous computation
15. Altmetric Badge
    Chapter 674 Set-theoretic properties of programs in stored program computers
16. Altmetric Badge
    Chapter 675 Classification of programs of a SPC
17. Altmetric Badge
    Chapter 676 The algebraic approach to the theory of computing systems
18. Altmetric Badge
    Chapter 677 Continuous simple Z-machines, Z-computable functions and sets of functions of n real variables
19. Altmetric Badge
    Chapter 678 An approach to correctness proofs of semicoroutines
20. Altmetric Badge
    Chapter 679 Towards an understanding of complex processes
21. Altmetric Badge
    Chapter 680 Simulation
22. Altmetric Badge
    Chapter 681 Concurrent programs
23. Altmetric Badge
    Chapter 682 Ultralinear expressions
24. Altmetric Badge
    Chapter 683 A family of algebraic systems related to the theory of equations on free monoids
25. Altmetric Badge
    Chapter 684 Stretching by probabilistic tree automata and Santos grammars
26. Altmetric Badge
    Chapter 685 Top down versus bottom up syntax analysis revised
27. Altmetric Badge
    Chapter 686 Substring languages
28. Altmetric Badge
    Chapter 687 Defining languages by Mazurkiewicz aigorithms
29. Altmetric Badge
    Chapter 688 Complexity and normal forms of context-free languages
30. Altmetric Badge
    Chapter 689 The axiomatization problem of a theory of linear languages
31. Altmetric Badge
    Chapter 690 A lattice-theoretical approach to problem-solving
32. Altmetric Badge
    Chapter 691 On the equivalence of planar grammars and parallel picture processing algorithms
33. Altmetric Badge
    Chapter 692 Combinatorial aspects of information storage and retrieval
34. Altmetric Badge
    Chapter 693 Modular approach to the logical theory of programs
35. Altmetric Badge
    Chapter 694 Proving programs by sets of computations
36. Altmetric Badge
    Chapter 695 Bases of paths in correctness proofs
37. Altmetric Badge
    Chapter 696 Algebraic models I
38. Altmetric Badge
    Chapter 697 Structured programmability of iterative algorithms
39. Altmetric Badge
    Chapter 698 On equivalence of programs
40. Altmetric Badge
    Chapter 699 Mathematical model of programs with dynamic allocation of variables
41. Altmetric Badge
    Chapter 700 Mathematical foundations of motivation languages and synthesis maps
42. Altmetric Badge
    Chapter 701 The semantics of semantic equations
43. Altmetric Badge
    Chapter 702 ω + -valued algorithmic logic as a tool to investigate procedures
44. Altmetric Badge
    Chapter 703 Call-by-value versus call-by-name: A proof-theoretic comparison
45. Altmetric Badge
    Chapter 704 Procedures, formal computations and models