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