Mathematical Foundations of Computer Science 1974: 3rd Symposium at Jadwisin near Warsaw, June 17 - 22, 1974: Lecture Notes in Computer Science, cartea 28

Sequential functions and generalized Moore and Mealy automata.- Mathematical methods of the theory of stochastic automata.- On the quasi-controllability of automata.- Models for analysis of races in sequential networks.- Factorizations, congruences, and the decomposition of automata and systems.- On the periodic sum and extensions of finite automata.- Finite branching automata: automata theory motivated by problem solving.- On configurations in cellular automata.- Finite automata acceptation of infinite sequences.- R-fuzzy automata with a time-variant structure.- Functions computable in the limit by probabilistic machines.- Some properties of limit recursive functions.- On some approximation problems of continuous computation.- Set-theoretic properties of programs in stored program computers.- Classification of programs of a SPC.- The algebraic approach to the theory of computing systems.- Continuous simple Z-machines, Z-computable functions and sets of functions of n real variables.- An approach to correctness proofs of semicoroutines.- Towards an understanding of complex processes.- Simulation.- Concurrent programs.- Ultralinear expressions.- A family of algebraic systems related to the theory of equations on free monoids.- Stretching by probabilistic tree automata and Santos grammars.- Top down versus bottom up syntax analysis revised.- Substring languages.- Defining languages by Mazurkiewicz aigorithms.- Complexity and normal forms of context-free languages.- The axiomatization problem of a theory of linear languages.- A lattice-theoretical approach to problem-solving.- On the equivalence of planar grammars and parallel picture processing algorithms.- Combinatorial aspects of information storage and retrieval.- Modular approach to the logical theory of programs.- Proving programs by sets of computations.- Bases of paths in correctness proofs.- Algebraic models I.- Structured programmability of iterative algorithms.- On equivalence of programs.- Mathematical model of programs with dynamic allocation of variables.- Mathematical foundations of motivation languages and synthesis maps.- The semantics of semantic equations.- ?+ -valued algorithmic logic as a tool to investigate procedures.- Call-by-value versus call-by-name: A proof-theoretic comparison.- Procedures, formal computations and models.