Fundamenta Informaticae, Volume 4

Volume 4, Number 1, 1981

Vincenzo Manca: Computational formalism: abstract combinatory view-point and related first order logical framework. 3-18
R. Danecki: Multiple regularity and binary ETOL-systems. 19-34
Tomasz Müldner: On the semantics of parallel programs. 35-82
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi: Lattice theoretic ordering properties for NP-complete optimization problems. 83-94
Tomasz Müldner: On the synchronizing tools for parallel programs. 95-134
Jürgen Albert, Hermann A. Maurer, Thomas Ottmann: On subregular OL forms. 135-150
Pierangelo Miglioli, Mario Ornaghi: A logically justified model of computation I. 151-172
T. R. M. Fischer: On universal binary search trees. 173-184
Gheorghe Paun: On eliminating the lambda-rules from simple matrix grammars. 185-196
Grzegorz Rozenberg, Dirk Vermeir: A hierarchy of ETOL languages with rank. 197-

Tomasz Müldner: On the compilation of parallel programs. 207-244
Cristian Calude, Gheorghe Paun: Global syntax and semantics for recursively enumerable languages. 245-254
Tomasz Müldner: Implementation and propertives of certain tools for parallel computations. 255-276
Pierangelo Miglioli, Mario Ornaghi: A logically justified model of computation II. 277-342
W. Przyluski: APC: the algorithmic predicate calculus. 343-368
Keijo Ruohonen: On a variant of a method of Berstel's and Nielsen's. 369-400
Dirk Vermeir, Walter J. Savitch: On the amount of non-determinism in pushdown in pushdown automata. 401-418
Miroslaw Truszczynski: Algorithmic aspects of the attribute set minimization problem. 419-426
J. Grabowski: On partial languages. 427-

M. Mrozek: Generalized inverse of a finite graph. 499-510
P. Rudnicki, A. Trybulec: A remark on the syntactic partition. 511-516
H. J. M. Goeman: The arbiter: an active system component for implementing synchronizing primitives. 517-530
Miklos Szijarto: A classification and closure properties of languages for describing concurrent system behaviours. 531-550
Zbigniew W. Ras: Information retrieval systems, an algebraic approach I. 551-604
Wiktor Danko: A Criterion of Undecidability of Algorithmic Theories. 605-628
Jerzy Tiuryn: Logic of effective definitions. 629-660
Jan A. Bergstra, Jerzy Tiuryn: Logic of effective definitions. 661-674
Grazyna Mirkowska: PAL - propositional algorithmic logic. 675-

Anton Nijholt: A survey of normal form covers for regular grammars. 761-776
Zbigniew W. Ras: Information retrieval systems, an algebraic approach II. 777-818
Pawel Urzyczyn: Algorithmic triviality of abstract structures. 819-850
Jan A. Bergstra, Jerzy Tiuryn: Algorithmic degrees of algebraic structures. 851-862
S. Janicki: Nonhomogeneous stochastic automata. 891-918
Petr Hájek, P. Kurka: A second-order dynamic logic with array assignments. 919-934
Jan A. Bergstra, John-Jules Ch. Meyer: On the quantifier-free fragment of 'Logic of effective definitions'. 935-956
Jean Marcel Pallo: Word problem in distributed magmas. 957-974
Andrzej Szalas: Algorithmic logic with recursive functions. 975-996
Jan A. Bergstra, Jerzy Tiuryn: Regular extensions of iterative algebras and metric interpretations. 997-1014
J. Gould: Automata in random environments. 1015-1040
M. Novotny: On sequents defined by means of information systems. 1041-