MFCS B

45 papers

YearTitle / Authors
1975Mathematical Foundations of Computer Science, 3rd Symposium at Jadwisin near Warsaw, Poland, June 17-22, 1974, Proceedings
Andrzej Blikle
1974A Family of Algebraic Systems Related to the Theory of Equations on Free Monoids.
Max Fontet
1974A Lattice-Theoretical Approach to Problem-Solving.
Jozef Kelemen
1974Algebraic Models I.
Hans-Jürgen Hoehnke
1974An Approach to Correctness Proofs of Semicoroutines.
Ole-Johan Dahl
1974Bases of Paths in Correctness Proofs.
Venelin K. Evtimov
1974Call-by-Value versus Call-by-Name: A proof-Theoretic Comparison.
Willem P. de Roever
1974Classification of Programs of a SPC.
Zbigniew W. Ras
1974Combinatorial Aspects of Information Storage and Retrieval.
Witold Lipski Jr.
1974Complexity and Normal Forms of Contex-Free Languages.
Alica Pirická
1974Concurrent Programs.
Józef Winkowski
1974Continuous Simple Z-Machines, Z-Computable Functions and Sets of Functions of n Real Variables.
Wojciech Zakowski
1974Defining Languages by Mazurkiewicz Algorithms.
W. A. Owsianiecka
1974Factorizations, Congruences, and the Decomposition of Automata and Systems.
Joseph A. Goguen, James W. Thatcher, Eric G. Wagner, Jesse B. Wright
1974Finite Automata Acceptation of Infinite Sequences.
Klaus W. Wagner, Ludwig Staiger
1974Finite Branching Automata: Automata Theory Motivated by Problem Solving.
Ivan M. Havel
1974Functions Computable in the Limit by Probabilistic Machines.
R. V. Freivald
1974Mathematical Foundations of Motivation Languages and Synthesis Maps.
Pierangelo Miglioli
1974Mathematical Methods of the Theory of Stochastic Automata.
Alberto Bertoni
1974Mathematical Model of Programs with Dynamic Allocation of Variables.
Jacek Leszczylowski
1974Models for Analysis of Races in Sequential Networks.
Janusz A. Brzozowski, Michael Yoeli
1974Modular Approach to the Logical Theory of Programs.
Lech Banachowski
1974On Configurations in Cellular Automata.
Peter Mikulecký
1974On Equivalence of Programs.
Jacek Leszczylowski
1974On Some Approximation Problems of Continuous Computation.
Beata Konikowska
1974On the Equivalence of Planar Grammars and Parallel Picture Processing Algorithms.
Zenon Kulpa
1974On the Periodic Sum and Extensions of Finite Automata.
Jerzy W. Grzymala-Busse
1974On the Quasi-Controllability of Automata.
L. Beyga
1974Procedures, Formal Computations and Models.
Andrzej Salwicki
1974Proving Programs by Sets of Computations.
Andrzej Blikle
1974R-Fuzzy Automata with a Time-Variant Structure.
Wolfgang Wechler
1974Sequential Functions and Generalized Moore and Mealy Automata.
Jirí Becvár
1974Set-Theoretic Properties of Programs in Stored Program Computers.
W. Kwasowiec
1974Simulation.
Andrzej Skowron
1974Some Properties of Limit Recursive Functions.
Bernhard G. Goetze, Reinhard Klette
1974Stretching by Probabilistic Tree Automata and Santos Grammars.
Marek Karpinski
1974Structured Programmability of Iterative Algorithms.
Jacek Irlik
1974Substring Languages.
Jan Maluszynski
1974The Algebraic Approach to the Theory of Computing Systems.
Jerzy Tiuryn
1974The Axiomatization Problem of a Theory of Linear Languages.
Gerd Wechsung
1974The Semantics of Semantic Equations.
Peter D. Mosses
1974Tow Down versus Bottom Up Syntax Analysis Revised.
Jaroslav Král
1974Towards an Understanding of Complex Processes.
Piotr Dembinski
1974Ultralinear Expressions.
J. P. Crestin
1974omega+-Valued Algorithmic Logic as a Tool to Investigate Procedures.
Helena Rasiowa