Fundamenta Informaticae, Volume 3

Volume 3, Number 1, 1980

J. Gould, E. J. Wegman: On probabilistic automata in deterministic environment. 1-14
Grzegorz Rozenberg, Dirk Vermeir: On metalinear ETOL systems. 15-36
Wojciech Rytter: Functional Automata. 37-44
Grazyna Mirkowska: Algorithmic logic with nondeterministic programs. 45-64
Ryszard Janicki: Some remarks on deterministic Mazurkiewicz algorithms and languages associated with them. 65-76
Eike Best: A theorem on the characteristics of nonsequential processes. 77-94
Douglas A. Cenzer: Non-generable formal languages. 95-104
Bruno Courcelle, Jean-Claude Raoult: Completions of ordered magmas. 105-

J. Gould: On stability of probabilistic automata in environments. 117-134
Gheorghe Paun: A note on the intersection of context-free languages. 135-140
Jürgen Albert, Hermann A. Maurer, Grzegorz Rozenberg: Simple EOL forms under uniform interpretation generating CF languages. 141-156
Grazyna Mirkowska: Model existence theorems in algorithmic logic with non-deterministic programs. 157-170
A. Bergstra, H. J. M. Goeman, Alexander Ollongren, G. A. Terpstra, Theo P. van der Weide: Axioms for multilevel objects. 171-180
Alexander Leitsch: Complexity of index sets and translating functions. 181-188
Vera Trnková: General theory of relational automata. 189-234
Ewa Orlowska: Resolution problem and their applications I. 235-

Teodor Rus: HAS-Hierarchy: A natural tool for language specification. 269-294
Grzegorz Rozenberg, Dirk Vermeir: A note on M-growth functions of FTOL systems with rank. 295-302
F. Adrianopoli: Conjugated measures of computational complexity. 303-310
Andrzej Salwicki: On the algorithmic theory of stacks. 311-332
Ewa Orlowska: Resolution systems and their applications II. 333-362
John Grant: Incomplete Information in a Relational Database. 363-378
Miroslaw Truszczynski: An algorithm of finding an acyclic f-graph for a family od sets. 379-396
Martti Penttonen: NP-completeness of combinatorial problems with unary notation for integers. 397-

Adrian Atanasiu: Tree-codifications and convolutional codes. 401-418
Stefan Sokolowski: Programs as term transformers. 419-432
S. Janicki: Sets generated by stochastic automata of Markov's chain type. 433-444
André Arnold, Maurice Nivat: The metric space of infinite trees. Algebraic and topological properties. 445-476
Felipe Bracho: Continously generated fixed points in P_omega. 477-490
Irina Gorun: On intersections of context-free languages. 491-496
Hans Kleine Büning: Decision problems in generalized vector addition systems. 497-