3. MFCS 1974: Jadwisin near Warsaw, Poland

Andrzej Blikle (Ed.): Mathematical Foundations of Computer Science, 3rd Symposium at Jadwisin near Warsaw, June 17-22, 1974, Proceedings. Lecture Notes in Computer Science 28 Springer 1975, ISBN 3-540-07162-8 BibTeX

@proceedings{DBLP:conf/mfcs/1974,
  editor    = {Andrzej Blikle},
  title     = {Mathematical Foundations of Computer Science, 3rd Symposium at
               Jadwisin near Warsaw, June 17-22, 1974, Proceedings},
  booktitle = {MFCS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {28},
  year      = {1975},
  isbn      = {3-540-07162-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Automata Theory

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

Computing Systems

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

Cooperating Processes and Simulation

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

Formal Languages

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

Mathematical Aspects of Application Methodology

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

Theory of Programs

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