2. MFCS 1973: Strbské Pleso, Czechoslovakia

Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, Strbské Pleso, High Tatras, Czechoslovakia, September 3-8, 1973. Mathematical Institute of the Slovak Academy of Sciences, 1973

Ya. M. Barzdin, K. M. Podineks: Towards a Theory of Inductive Inference (in Russian). 9-15 BibTeX
Andrzej Blikle: An Algebraic Approach to Programs and Their Computations. 17-26 BibTeX
Karel Culík: Equivalences of Parallel Courses of Algorithmic Nets and Precedence Flow Diagrams. 27-38 BibTeX
B. Dömölki: On the Formal Definition of Assembly Languages. 39-50 BibTeX
Erwin Engeler: Towards a Galois Theory of Algorithmic Problems. 51-55 BibTeX
Ferenc Gécseg: Model Theoretical Methods in the Theory of Automata. 57-63 BibTeX
Seymour Ginsburg: Substitution and (Semi-)AFL. 65-69 BibTeX
Jozef Gruska: Descriptional Complexity of Context-Free Languages. 71-83 BibTeX
Petr Hájek: Some Logical Problems of Automated Research. 85-93 BibTeX
Juris Hartmanis: On the Problem of Finding Natural Computational Complexity Measures. 95-103 BibTeX
Patrick J. Hayes: Computation and Deduction. 105-117 BibTeX
Maurice Nivat: Operators on Families of Languages. 119-124 BibTeX
Miroslav Novotný: Constructions of Grammars for Formal Languages. 125-133 BibTeX
Zdzislaw Pawlak: Mathematical Foundation of Information Retrieval. 135-136 BibTeX
C. A. Petri: Concepts of Net Theory. 137-146 BibTeX
Arto Salomaa: L-Systems: A Device in Biologically Motivated Automata Theory. 147-151 BibTeX
Claus-Peter Schnorr: Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations. 153-161 BibTeX
Peter H. Starke: On the Sequential Relations of Time-Invariant Automata. 163-168 BibTeX
Luigia Carlucci Aiello, Ugo Montanari: Towards a Formal Definition of the Control in Structured Programs. 169-174 BibTeX
A. V. Anisimov: Top-down Analysis of Programming Languages without Backtrack (in Russian). 175-180 BibTeX
W. Bartol: Semiboolean Algebras of Submachines. 181-183 BibTeX
Alberto Bertoni: Equations of Formal Power Series over Non Commutative Semiring. 185-190 BibTeX
Wilfried Brauer: On Grammatical Complexity of Context-Free Languages (Extended Abstract). 191-196 BibTeX
Michal Chytil: On Changes of Input/Output Coding. 197-201 BibTeX
J. P. Cleave: Combinatorial Problems III. Degrees of Combinatorial Problems of Computing Machines. 203-207 BibTeX
Armin B. Cremers, Otto Mayer: On Vector Languages. 209-213 BibTeX
Robert P. Daley: The Process Complexity and the Understanding of Sequences. 215-218 BibTeX
A. A. Donis: Conditional Metric Completeness of Finite Sets of Automata: A Criterion and an Algorithm (in Russian). 219-224 BibTeX
Philippe Flajolet, Jean-Marc Steyaert: Decision Problems for Multihead Finite Automata. 225-230 BibTeX
Jerzy W. Grzymala-Busse: On the Connectivity of the Periodic Sum of Automata. 231-234 BibTeX
J. Horejs: An Algebraic Model for Parallel Processes. 235-238 BibTeX
Klaus Indermark: On Ianov Schemas with One Memory Location. 239-245 BibTeX
Ivan Korec: Computational Complexity Based on Expectation of the Time of Computation on Minsky Machines. 247-250 BibTeX
Jaroslav Král: Some Sources of Primitive Constructs in Programming Languages. 251-254 BibTeX
Herbert Küstner: An Algebraic Characterization of Stochastic Finite-State Automata and Their Behaviour Functions. 255-258 BibTeX
Daniele Marini, Pierangelo Miglioli: Characterization of Programs and Their Synthesis from a Formalized Theory. 259-266 BibTeX
Jaroslav Morávek: Computational Optimality of a Dynamic Programming Method. 267-270 BibTeX
Miloslav Nekvinda: On the Complexity of Countable Functions (Abstract). 271-272 BibTeX
Peter A. Ng, Raymond T. Yeh: Tree Transformations via Finite Recursive Transition Machines. 273-277 BibTeX
I. Peák, N. Q. Khang: On Endomorphism Semigroup of Nilpotent Automata. 279-284 BibTeX
Vaclav Rajlich: Relational Structures and Dynamics of Certain Discrete Systems. 285-291 BibTeX
Willem P. de Roever: Operational and Mathematical Semantics for Recursive Polyadic Program Schemata. 293-298 BibTeX
Branislav Rovan: Necessary Conditions for Containment of Principal (Semi-)AFL with Bounded Generators. 299-305 BibTeX
L. G. Samoilenko: Construction and Properties of Context-Sensitive Grammars and Languages (in Russian). 307-311 BibTeX
Dan A. Simovici: On Some Measures on Free Semigroups Induced by Semiautomata. 313-316 BibTeX
Andrzej Skowron: Machines with Input and Output. 317-319 BibTeX
Olga Stepánková, Ivan M. Havel: Some Results Concerning the Situation Calculus. 321-326 BibTeX
Hans-Georg Stork: A Note on Improving Input Strings for Paging Machines. 327-330 BibTeX
Pavel Strnad: Turing Machine Recognition. 331-332 BibTeX
Ivan Hal Sudborough, A. Zalcberg: On Families of Languages Defined by Time-Bounded Random Access Machines. 333-338 BibTeX