Abstract is missing.
- Construction of Complete Sample System for Correctness TestingJanis Barzdin, Janis Bicevskis, Audris Kalnins. 1-12
- Ten Years of SpeedupPeter van Emde Boas. 13-29
- On Logics of DiscoveryPetr Hájek. 30-45
- On Models of Protection in Operating SystemsMichael A. Harrison. 46-60
- Parsing as a Subtask of CompilingJaroslav Král, Jirí Demner. 61-74
- Parallel Recursive Program SchemesAntoni W. Mazurkiewicz. 75-87
- On Some Problems Concerning Pawlak s MachinesMiroslav Novotný. 88-100
- Formal Power Series and Growth Functions of Lindenmayer SystemsArto Salomaa. 101-113
- On the Representability of Relations by Deterministic and Nondeterministic Multi-Tape AutomataPeter H. Starke. 114-124
- On Problems Solvable by Successive TrialsBoris A. Trakhtenbrot. 125-137
- Automate and CategoriesVera Trnková. 138-152
- On Some Models of Computability of Boolean FunctionsI. D. Zaslavskii. 153-159
- Automata and Categories: Finiteness Contra MinimalityJirí Adámek. 160-166
- Languages Over Free GroupsA. V. Anisimov. 167-171
- On the Comparison of Notions of ApproximationGiorgio Ausiello, Marco Protasi. 172-178
- Non-Linear Speed-Up Theorem for Two Register Minsky MachinesM. Benesová, Ivan Korec. 179-185
- Systems of Open Paths in Petri NetsEike Best, Hans Albrecht Schmid. 186-193
- on the Largest Full Sub-AFL of the Full AFL of Context-Free LanguagesLuc Boasson. 194-198
- On Complexity of Nondeterministic Turing Machines ComputationsMichal Chytil. 199-205
- On Closure Properties of Context-Free Derivation Complexity ClassesAlexander Ja. Dikovsky. 206-211
- Control Structures in Single Block ProgramsVenelin K. Evtimov. 212-218
- Minimal Gödel Numbers and Their Identification in the LimitR. V. Freivald. 219-225
- Isomorphic Representation of AutomataFerenc Gécseg. 226-230
- Extended Simple Regular ExpressionsHartmann J. Genrich. 231-237
- Conniver Programs by Logical Point of ViewGiuseppina C. Gini, Maria L. Gini. 238-245
- On the Set of All Automata with the Same Monoid of EndomorphismsJerzy W. Grzymala-Busse. 246-251
- Nondterministically Recognizable Sets of LanguagesIvan M. Havel. 252-257
- The Approximation Problem in Computational StatisticsTomás Havránek. 258-265
- The Continuous Algebra of Monadic LanguagesKlaus Indermark. 266-270
- On Sets of Complex-Programmed NumbersMax I. Kanovic. 271-272
- Decision Algorithms for Havel s Branching AutomataMarek Karpinski. 273-279
- Automata and Categories - Input ProcessesVáclav Koubek, Jan Reiterman. 280-286
- Formalization of Algorithmic ReasoningFred Kröger. 287-293
- Proving Program Properties, Symbolic Evaluation and Logical Procedural SemanticsGiorgio Levi, Franco Sirovich. 294-301
- A Contribution to Error RecoveryJan Maluszynski. 302-307
- On the Analysis and Synthesis Problems for Context-Free ExpressionsOtto Mayer. 308-314
- Monotone Switching Circuits and Boolean Matrix ProductKurt Mehlhorn, Zvi Galil. 315-319
- On Some Lattice-Theoretic Properties of Generable LanguagesIvan Mezník. 320-325
- On Some Formal Grammars Generating Dependency TreesLarisa S. Modina. 326-329
- Graph Walking AutomataPeter A. Ng, Pei Hsia, Raymond T. Yeh. 330-336
- On Finding All Solutions of the Partitioning ProblemJürgen Perl. 337-343
- Greibach Normal Form ComplexityAlica Pirická-Kelemenová. 344-350
- On Correctness and Essentiality of Some Ianov Schemas Equivalence RelationsRimma I. Podlovchenko. 351-357
- Polynomially Complete Problems in the Logic of Automated DiscoveryPavel Pudlák. 358-361
- Relational definition of Computer LanguagesVaclav Rajlich. 362-376
- First-Order Reductions of Call-by-Name to Call-by-ValueWillem P. de Roever. 377-398
- Local Disambiguating TransformationPeter Ruzicka. 399-404
- On Cardinal Sequential Outer MeasuresDan A. Simovici. 405-410
- On Representation of Sequential and Parallel FunctionsMark B. Trakhtenbrot. 411-417
- The Theory of the Modified Post Algebras and Multidimensional Automata StructuresG. E. Tseytlin. 418-425
- An Algebraic Theory of Formal LanguagesRaymond Turner. 426-431
- On Polynomial Reducibility of Word Problem Under Embedding of Recursively Presented Groups in Finitely Presented GroupsMars K. Valiev. 432-438
- On the Synthesis of Automata with Several Initial StatesRüdiger Valk. 439-444
- A Hierarchy of Regular Sequence SetsKlaus W. Wagner. 445-449
- R-Fuzzy GrammarsWolfgang Wechler. 450-456
- Characterization of Some Classes of Context-Free Languages in Terms of Complexity ClassesGerd Wechsung. 457-461
- Inductive Inference of Recursive FunctionsRolf Wiehagen. 462-464
- Proving Properties of Programs by Means of Predicate LogicJózef Winkowski. 465-471
- A Generalization of Scott s Flow DiagramsBoleslaw Wojdylo. 472-476