03444nmm a2200313 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100002500139245015900164250001700323260006300340300003200403505046900435505092400904505100101828653002102829653001402850653002602864653003002890710003402920041001902954989003802973490003803011856006803049082001303117EB000653782EBX0100000000000000050686400000000000000.0cr|||||||||||||||||||||140122 ||| eng a97835403749231 aBlikle, A.e[editor]00aMathematical Foundations of Computer Science 1974hElektronische Ressourceb3rd Symposium at Jadwisin near Warsaw, June 17 - 22, 1974cedited by A. Blikle a1st ed. 1975 aBerlin, HeidelbergbSpringer Berlin Heidelbergc1975, 1975 aVII, 485 pbonline resource0 aAlgebraic 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 models0 aSequential 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 -- 0 aContinuous 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 -- aComputer science aComputers aTheory of Computation aComputer Science, general2 aSpringerLink (Online service)07aeng2ISO 639-2 bSBAaSpringer Book Archives -20040 aLecture Notes in Computer Science uhttps://doi.org/10.1007/3-540-07162-8?nosfx=yxVerlag3Volltext0 a004.0151