Jiří Bečvář (auth.), A. Blikle (eds.)9783540071624, 3540071628
Table of contents :
Sequential functions and generalized Moore and Mealy automata….Pages 1-8
Mathematical methods of the theory of stochastic automata….Pages 9-22
On the quasi-controllability of automata….Pages 23-25
Models for analysis of races in sequential networks….Pages 26-32
Factorizations, congruences, and the decomposition of automata and systems….Pages 33-45
On the periodic sum and extensions of finite automata….Pages 46-52
Finite branching automata: automata theory motivated by problem solving….Pages 53-61
On configurations in cellular automata….Pages 62-68
Finite automata acceptation of infinite sequences….Pages 69-72
R-fuzzy automata with a time-variant structure….Pages 73-76
Functions computable in the limit by probabilistic machines….Pages 77-87
Some properties of limit recursive functions….Pages 88-90
On some approximation problems of continuous computation….Pages 91-106
Set-theoretic properties of programs in stored program computers….Pages 107-113
Classification of programs of a SPC….Pages 114-125
The algebraic approach to the theory of computing systems….Pages 126-142
Continuous simple Z-machines, Z-computable functions and sets of functions of n real variables….Pages 143-156
An approach to correctness proofs of semicoroutines….Pages 157-174
Towards an understanding of complex processes….Pages 175-185
Simulation….Pages 186-201
Concurrent programs….Pages 202-221
Ultralinear expressions….Pages 222-231
A family of algebraic systems related to the theory of equations on free monoids….Pages 232-248
Stretching by probabilistic tree automata and Santos grammars….Pages 249-255
Top down versus bottom up syntax analysis revised….Pages 256-273
Substring languages….Pages 274-284
Defining languages by Mazurkiewicz aigorithms….Pages 285-291
Complexity and normal forms of context-free languages….Pages 292-297
The axiomatization problem of a theory of linear languages….Pages 298-302
A lattice-theoretical approach to problem-solving….Pages 303-306
On the equivalence of planar grammars and parallel picture processing algorithms….Pages 307-312
Combinatorial aspects of information storage and retrieval….Pages 313-326
Modular approach to the logical theory of programs….Pages 327-332
Proving programs by sets of computations….Pages 333-358
Bases of paths in correctness proofs….Pages 359-360
Algebraic models I….Pages 361-371
Structured programmability of iterative algorithms….Pages 372-376
On equivalence of programs….Pages 377-380
Mathematical model of programs with dynamic allocation of variables….Pages 381-387
Mathematical foundations of motivation languages and synthesis maps….Pages 388-408
The semantics of semantic equations….Pages 409-422
ω + -valued algorithmic logic as a tool to investigate procedures….Pages 423-450
Call-by-value versus call-by-name: A proof-theoretic comparison….Pages 451-463
Procedures, formal computations and models….Pages 464-484
Reviews
There are no reviews yet.