Table of Contents

• An Algebraic Approach to Programs and Their ComputationsAndrzej Blikle. 17-26
• Equivalences of Parallel Courses of Algorithmic Nets and Precedence Flow DiagramsKarel Culík. 27-38
• Towards a Galois Theory of Algorithmic ProblemsErwin Engeler. 51-55
• Model Theoretical Methods in the Theory of AutomataFerenc Gécseg. 57-63
• Substitution and (Semi-)AFLSeymour Ginsburg. 65-69
• Descriptional Complexity of Context-Free LanguagesJozef Gruska. 71-83
• Some Logical Problems of Automated ResearchPetr Hájek. 85-93
• On the Problem of Finding Natural Computational Complexity MeasuresJuris Hartmanis. 95-103
• Computation and DeductionPatrick J. Hayes. 105-117
• Operators on Families of LanguagesMaurice Nivat. 119-124
• Constructions of Grammars for Formal LanguagesMiroslav Novotný. 125-133
• Mathematical Foundation of Information RetrievalZdzislaw Pawlak. 135-136
• L-Systems: A Device in Biologically Motivated Automata TheoryArto Salomaa. 147-151
• Lower Bounds for the Product of Time and Space Requirements of Turing Machine ComputationsClaus-Peter Schnorr. 153-161
• On the Sequential Relations of Time-Invariant AutomataPeter H. Starke. 163-168
• Towards a Formal Definition of the Control in Structured ProgramsLuigia Carlucci Aiello, Ugo Montanari. 169-174
• Equations of Formal Power Series over Non Commutative SemiringAlberto Bertoni. 185-190
• On Grammatical Complexity of Context-Free Languages (Extended Abstract)Wilfried Brauer. 191-196
• On Changes of Input/Output CodingMichal Chytil. 197-201
• On Vector LanguagesArmin B. Cremers, Otto Mayer. 209-213
• The Process Complexity and the Understanding of SequencesRobert P. Daley. 215-218
• Decision Problems for Multihead Finite AutomataPhilippe Flajolet, Jean-Marc Steyaert. 225-230
• On the Connectivity of the Periodic Sum of AutomataJerzy W. Grzymala-Busse. 231-234
• An Algebraic Model for Parallel ProcessesJ. Horejs. 235-238
• On Ianov Schemas with One Memory LocationKlaus Indermark. 239-245
• Computational Complexity Based on Expectation of the Time of Computation on Minsky MachinesIvan Korec. 247-250
• Some Sources of Primitive Constructs in Programming LanguagesJaroslav Král. 251-254
• Characterization of Programs and Their Synthesis from a Formalized TheoryDaniele Marini, Pierangelo Miglioli. 259-266
• Computational Optimality of a Dynamic Programming MethodJaroslav Morávek. 267-270
• Tree Transformations via Finite Recursive Transition MachinesPeter A. Ng, Raymond T. Yeh. 273-277
• Relational Structures and Dynamics of Certain Discrete SystemsVaclav Rajlich. 285-291
• Operational and Mathematical Semantics for Recursive Polyadic Program SchemataWillem P. de Roever. 293-298
• Necessary Conditions for Containment of Principal (Semi-)AFL with Bounded GeneratorsBranislav Rovan. 299-305
• On Some Measures on Free Semigroups Induced by SemiautomataDan A. Simovici. 313-316
• Some Results Concerning the Situation CalculusOlga Stepánková, Ivan M. Havel. 321-326
• A Note on Improving Input Strings for Paging MachinesHans-Georg Stork. 327-330
• On Families of Languages Defined by Time-Bounded Random Access MachinesIvan Hal Sudborough, A. Zalcberg. 333-338