3. MFCS 1974: Jadwisin near Warsaw, Poland

Automata Theory

• Jirí Becvár:
  Sequential Functions and Generalized Moore and Mealy Automata. 1-8
  
• Alberto Bertoni:
  Mathematical Methods of the Theory of Stochastic Automata. 9-22
  
• L. Beyga:
  On the Quasi-Controllability of Automata. 23-25
  
• Janusz A. Brzozowski, Michael Yoeli:
  Models for Analysis of Races in Sequential Networks. 26-32
  
• Joseph A. Goguen, James W. Thatcher, Eric G. Wagner, Jesse B. Wright:
  Factorizations, Congruences, and the Decomposition of Automata and Systems. 33-45
  
• Jerzy W. Grzymala-Busse:
  On the Periodic Sum and Extensions of Finite Automata. 46-52
  
• Ivan M. Havel:
  Finite Branching Automata: Automata Theory Motivated by Problem Solving. 53-61
  
• Peter Mikulecký:
  On Configurations in Cellular Automata. 62-68
  
• Klaus W. Wagner, Ludwig Staiger:
  Finite Automata Acceptation of Infinite Sequences. 69-72
  
• Wolfgang Wechler:
  R-Fuzzy Automata with a Time-Variant Structure. 73-76
  

Computing Systems

• R. V. Freivald:
  Functions Computable in the Limit by Probabilistic Machines. 77-87
  
• Bernhard Goetze, Reinhard Klette:
  Some Properties of Limit Recursive Functions. 88-90
  
• Beata Konikowska:
  On Some Approximation Problems of Continuous Computation. 91-106
  
• W. Kwasowiec:
  Set-Theoretic Properties of Programs in Stored Program Computers. 107-113
  
• Zbigniew W. Ras:
  Classification of Programs of a SPC. 114-125
  
• Jerzy Tiuryn:
  The Algebraic Approach to the Theory of Computing Systems. 126-142
  
• Wojciech Zakowski:
  Continuous Simple Z-Machines, Z-Computable Functions and Sets of Functions of n Real Variables. 143-156
  

Cooperating Processes and Simulation

• Ole-Johan Dahl:
  An Approach to Correctness Proofs of Semicoroutines. 157-174
  
• Piotr Dembinski:
  Towards an Understanding of Complex Processes. 175-185
  
• Andrzej Skowron:
  Simulation. 186-201
  
• Józef Winkowski:
  Concurrent Programs. 202-221
  

Formal Languages

• J. P. Crestin:
  Ultralinear Expressions. 222-231
  
• Max Fontet:
  A Family of Algebraic Systems Related to the Theory of Equations on Free Monoids. 232-248
  
• Marek Karpinski:
  Stretching by Probabilistic Tree Automata and Santos Grammars. 249-255
  
• Jaroslav Král:
  Tow Down versus Bottom Up Syntax Analysis Revised. 256-273
  
• Jan Maluszynski:
  Substring Languages. 274-284
  
• W. A. Owsianiecka:
  Defining Languages by Mazurkiewicz Algorithms. 285-291
  
• Alica Pirická:
  Complexity and Normal Forms of Contex-Free Languages. 292-297
  
• Gerd Wechsung:
  The Axiomatization Problem of a Theory of Linear Languages. 298-302
  

Mathematical Aspects of Application Methodology

• Jozef Kelemen:
  A Lattice-Theoretical Approach to Problem-Solving. 303-306
  
• Zenon Kulpa:
  On the Equivalence of Planar Grammars and Parallel Picture Processing Algorithms. 307-312
  
• Witold Lipski Jr.:
  Combinatorial Aspects of Information Storage and Retrieval. 313-326
  

Theory of Programs

• Lech Banachowski:
  Modular Approach to the Logical Theory of Programs. 327-332
  
• Andrzej Blikle:
  Proving Programs by Sets of Computations. 333-358
  
• Venelin K. Evtimov:
  Bases of Paths in Correctness Proofs. 359-360
  
• Hans-Jürgen Hoehnke:
  Algebraic Models I. 361-371
  
• Jacek Irlik:
  Structured Programmability of Iterative Algorithms. 372-376
  
• Jacek Leszczylowski:
  On Equivalence of Programs. 377-380
  
• Jacek Leszczylowski:
  Mathematical Model of Programs with Dynamic Allocation of Variables. 381-387
  
• Pierangelo Miglioli:
  Mathematical Foundations of Motivation Languages and Synthesis Maps. 388-408
  
• Peter D. Mosses:
  The Semantics of Semantic Equations. 409-422
  
• Helena Rasiowa:
  omega+-Valued Algorithmic Logic as a Tool to Investigate Procedures. 423-450
  
• Willem P. de Roever:
  Call-by-Value versus Call-by-Name: A proof-Theoretic Comparison. 451-463
  
• Andrzej Salwicki:
  Procedures, Formal Computations and Models. 464-484