Abstract is missing.
- Sequential Functions and Generalized Moore and Mealy AutomataJirí Becvár. 1-8
- Mathematical Methods of the Theory of Stochastic AutomataAlberto Bertoni. 9-22
- On the Quasi-Controllability of AutomataL. Beyga. 23-25
- Models for Analysis of Races in Sequential NetworksJanusz A. Brzozowski, Michael Yoeli. 26-32
- Factorizations, Congruences, and the Decomposition of Automata and SystemsJoseph A. Goguen, James W. Thatcher, Eric G. Wagner, Jesse B. Wright. 33-45
- On the Periodic Sum and Extensions of Finite AutomataJerzy W. Grzymala-Busse. 46-52
- Finite Branching Automata: Automata Theory Motivated by Problem SolvingIvan M. Havel. 53-61
- On Configurations in Cellular AutomataPeter Mikulecký. 62-68
- Finite Automata Acceptation of Infinite SequencesKlaus W. Wagner, Ludwig Staiger. 69-72
- R-Fuzzy Automata with a Time-Variant StructureWolfgang Wechler. 73-76
- Functions Computable in the Limit by Probabilistic MachinesR. V. Freivald. 77-87
- Some Properties of Limit Recursive FunctionsBernhard Goetze, Reinhard Klette. 88-90
- On Some Approximation Problems of Continuous ComputationBeata Konikowska. 91-106
- Set-Theoretic Properties of Programs in Stored Program ComputersW. Kwasowiec. 107-113
- Classification of Programs of a SPCZbigniew W. Ras. 114-125
- The Algebraic Approach to the Theory of Computing SystemsJerzy Tiuryn. 126-142
- Continuous Simple Z-Machines, Z-Computable Functions and Sets of Functions of n Real VariablesWojciech Zakowski. 143-156
- An Approach to Correctness Proofs of SemicoroutinesOle-Johan Dahl. 157-174
- Towards an Understanding of Complex ProcessesPiotr Dembinski. 175-185
- SimulationAndrzej Skowron. 186-201
- Concurrent ProgramsJózef Winkowski. 202-221
- Ultralinear ExpressionsJ. P. Crestin. 222-231
- A Family of Algebraic Systems Related to the Theory of Equations on Free MonoidsMax Fontet. 232-248
- Stretching by Probabilistic Tree Automata and Santos GrammarsMarek Karpinski. 249-255
- Tow Down versus Bottom Up Syntax Analysis RevisedJaroslav Král. 256-273
- Substring LanguagesJan Maluszynski. 274-284
- Defining Languages by Mazurkiewicz AlgorithmsW. A. Owsianiecka. 285-291
- Complexity and Normal Forms of Contex-Free LanguagesAlica Pirická. 292-297
- The Axiomatization Problem of a Theory of Linear LanguagesGerd Wechsung. 298-302
- A Lattice-Theoretical Approach to Problem-SolvingJozef Kelemen. 303-306
- On the Equivalence of Planar Grammars and Parallel Picture Processing AlgorithmsZenon Kulpa. 307-312
- Combinatorial Aspects of Information Storage and RetrievalWitold Lipski Jr.. 313-326
- Modular Approach to the Logical Theory of ProgramsLech Banachowski. 327-332
- Proving Programs by Sets of ComputationsAndrzej Blikle. 333-358
- Bases of Paths in Correctness ProofsVenelin K. Evtimov. 359-360
- Algebraic Models IHans-Jürgen Hoehnke. 361-371
- Structured Programmability of Iterative AlgorithmsJacek Irlik. 372-376
- On Equivalence of ProgramsJacek Leszczylowski. 377-380
- Mathematical Model of Programs with Dynamic Allocation of VariablesJacek Leszczylowski. 381-387
- Mathematical Foundations of Motivation Languages and Synthesis MapsPierangelo Miglioli. 388-408
- The Semantics of Semantic EquationsPeter D. Mosses. 409-422
- omega+-Valued Algorithmic Logic as a Tool to Investigate ProceduresHelena Rasiowa. 423-450
- Call-by-Value versus Call-by-Name: A proof-Theoretic ComparisonWillem P. de Roever. 451-463
- Procedures, Formal Computations and ModelsAndrzej Salwicki. 464-484