You have Guest access.
Log In
A. Blikle
Front matter
1-8
Sequential functions and generalized Moore and Mealy automata
9-22
Mathematical methods of the theory of stochastic automata
23-25
On the quasi-controllability of automata
26-32
Models for analysis of races in sequential networks
33-45
Factorizations, congruences, and the decomposition of automata and systems
46-52
On the periodic sum and extensions of finite automata
53-61
Finite branching automata: automata theory motivated by problem solving
62-68
On configurations in cellular automata
69-72
Finite automata acceptation of infinite sequences
73-76
R-fuzzy automata with a time-variant structure
77-87
Functions computable in the limit by probabilistic machines
88-90
Some properties of limit recursive functions
91-106
On some approximation problems of continuous computation
107-113
Set-theoretic properties of programs in stored program computers
114-125
Classification of programs of a SPC
126-142
The algebraic approach to the theory of computing systems
143-156
Continuous simple Z-machines, Z-computable functions and sets of functions of n real variables
157-174
An approach to correctness proofs of semicoroutines
175-185
Towards an understanding of complex processes
186-201
Simulation
202-221
Concurrent programs
222-231
Ultralinear expressions
232-248
A family of algebraic systems related to the theory of equations on free monoids
249-255
Stretching by probabilistic tree automata and Santos grammars
256-273
Top down versus bottom up syntax analysis revised
274-284
Substring languages
285-291
Defining languages by Mazurkiewicz aigorithms
292-297
Complexity and normal forms of context-free languages
298-302
The axiomatization problem of a theory of linear languages
303-306
A lattice-theoretical approach to problem-solving
307-312
On the equivalence of planar grammars and parallel picture processing algorithms
313-326
Combinatorial aspects of information storage and retrieval
327-332
Modular approach to the logical theory of programs
333-358
Proving programs by sets of computations
359-360
Bases of paths in correctness proofs
361-371
Algebraic models I
372-376
Structured programmability of iterative algorithms
377-380
On equivalence of programs
381-387
Mathematical model of programs with dynamic allocation of variables
388-408
Mathematical foundations of motivation languages and synthesis maps
409-422
The semantics of semantic equations
423-450
ω+ -valued algorithmic logic as a tool to investigate procedures
451-463
Call-by-value versus call-by-name: A proof-theoretic comparison
464-484
Procedures, formal computations and models
Jiří Bečvář
A. Bertoni
L. Beyga
J. A. Brzozowski and M. Yoeli
J. A. Goguen, J. W. Thatcher, E. G. Wagner and J. B. Wright
Jerzy W. Grzymala-Busse
Ivan M. Havel
Peter Mikulecký
K. Wagner and L. Staiger
W. Wechler
R. V. Freivald
B. Goetze and R. Klette
B. Konikowska
W. Kwasowiec
Z. Raś
Jerzy Tiuryn
W. Żakowski
Ole-Johan Dahl
P. Dembiński
A. Skowron
J. Winkowski
J. P. Crestin
Max Fontet
Marek Karpiński
J. Král
J. Małuszyński
W. A. Owsianiecka
A. Pirická
G. Wechsung
Jozef Kelemen
Zenon Kulpa
Witold Lipski
L. Banachowski
V. K. Evtimov
Hans-Jürgen Hoehnke
Jacek Irlik
J. Leszczyłowski
Pierangelo Miglioli
P. D. Mosses
H. Rasiowa
W. P. De Roever
Andrzej Salwicki
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info