default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFundamenta Informaticae, Volume 4
Volume 4, Number 1, 1981
- Vincenzo Manca:
Computational formalism: abstract combinatory view-point and related first order logical framework. Fundam. Informaticae 4(1): 3-18 (1981) - R. Danecki:
Multiple regularity and binary ETOL-systems. Fundam. Informaticae 4(1): 19-34 (1981) - Tomasz Müldner:
On the semantics of parallel programs. Fundam. Informaticae 4(1): 35-82 (1981) - Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
Lattice theoretic ordering properties for NP-complete optimization problems. Fundam. Informaticae 4(1): 83-94 (1981) - Tomasz Müldner:
On the synchronizing tools for parallel programs. Fundam. Informaticae 4(1): 95-134 (1981) - Jürgen Albert, Hermann A. Maurer, Thomas Ottmann:
On subregular OL forms. Fundam. Informaticae 4(1): 135-150 (1981) - Pierangelo Miglioli, Mario Ornaghi:
A logically justified model of computation I. Fundam. Informaticae 4(1): 151-172 (1981) - T. R. M. Fischer:
On universal binary search trees. Fundam. Informaticae 4(1): 173-184 (1981) - Gheorghe Paun:
On eliminating the lambda-rules from simple matrix grammars. Fundam. Informaticae 4(1): 185-196 (1981) - Grzegorz Rozenberg, Dirk Vermeir:
A hierarchy of ETOL languages with rank. Fundam. Informaticae 4(1): 197- (1981)
Volume 4, Number 2, 1981
- Tomasz Müldner:
On the compilation of parallel programs. Fundam. Informaticae 4(2): 207-244 (1981) - Cristian Calude, Gheorghe Paun:
Global syntax and semantics for recursively enumerable languages. Fundam. Informaticae 4(2): 245-254 (1981) - Tomasz Müldner:
Implementation and propertives of certain tools for parallel computations. Fundam. Informaticae 4(2): 255-276 (1981) - Pierangelo Miglioli, Mario Ornaghi:
A logically justified model of computation II. Fundam. Informaticae 4(2): 277-342 (1981) - W. Przyluski:
APC: the algorithmic predicate calculus. Fundam. Informaticae 4(2): 343-368 (1981) - Keijo Ruohonen:
On a variant of a method of Berstel's and Nielsen's. Fundam. Informaticae 4(2): 369-400 (1981) - Dirk Vermeir, Walter J. Savitch:
On the amount of non-determinism in pushdown in pushdown automata. Fundam. Informaticae 4(2): 401-418 (1981) - Miroslaw Truszczynski:
Algorithmic aspects of the attribute set minimization problem. Fundam. Informaticae 4(2): 419-426 (1981) - J. Grabowski:
On partial languages. Fundam. Informaticae 4(2): 427- (1981)
Volume 4, Number 3, 1981
- Marian Mrozek:
Generalized inverse of a finite graph. Fundam. Informaticae 4(3): 499-510 (1981) - P. Rudnicki, A. Trybulec:
A remark on the syntactic partition. Fundam. Informaticae 4(3): 511-516 (1981) - H. J. M. Goeman:
The arbiter: an active system component for implementing synchronizing primitives. Fundam. Informaticae 4(3): 517-530 (1981) - Miklos Szijarto:
A classification and closure properties of languages for describing concurrent system behaviours. Fundam. Informaticae 4(3): 531-550 (1981) - Zbigniew W. Ras:
Information retrieval systems, an algebraic approach I. Fundam. Informaticae 4(3): 551-604 (1981) - Wiktor Danko:
A Criterion of Undecidability of Algorithmic Theories. Fundam. Informaticae 4(3): 605-628 (1981) - Jerzy Tiuryn:
Logic of effective definitions. Fundam. Informaticae 4(3): 629-660 (1981) - Jan A. Bergstra, Jerzy Tiuryn:
Logic of effective definitions. Fundam. Informaticae 4(3): 661-674 (1981) - Grazyna Mirkowska:
PAL - propositional algorithmic logic. Fundam. Informaticae 4(3): 675- (1981)
Volume 4, Number 4, 1981
- Anton Nijholt:
A survey of normal form covers for regular grammars. Fundam. Informaticae 4(4): 761-776 (1981) - Zbigniew W. Ras:
Information retrieval systems, an algebraic approach II. Fundam. Informaticae 4(4): 777-818 (1981) - Pawel Urzyczyn:
Algorithmic triviality of abstract structures. Fundam. Informaticae 4(4): 819-850 (1981) - Jan A. Bergstra, Jerzy Tiuryn:
Algorithmic degrees of algebraic structures. Fundam. Informaticae 4(4): 851-862 (1981) - S. Janicki:
Nonhomogeneous stochastic automata. Fundam. Informaticae 4(4): 891-918 (1981) - Petr Hájek, Petr Kurka:
A second-order dynamic logic with array assignments. Fundam. Informaticae 4(4): 919-934 (1981) - Jan A. Bergstra, John-Jules Ch. Meyer:
On the quantifier-free fragment of 'Logic of effective definitions'. Fundam. Informaticae 4(4): 935-956 (1981) - Jean Marcel Pallo:
Word problem in distributed magmas. Fundam. Informaticae 4(4): 957-974 (1981) - Andrzej Szalas:
Algorithmic logic with recursive functions. Fundam. Informaticae 4(4): 975-996 (1981) - Jan A. Bergstra, Jerzy Tiuryn:
Regular extensions of iterative algebras and metric interpretations. Fundam. Informaticae 4(4): 997-1014 (1981) - Jerren Gould:
Automata in random environments. Fundam. Informaticae 4(4): 1015-1040 (1981) - Miroslav Novotný:
On sequents defined by means of information systems. Fundam. Informaticae 4(4): 1041- (1981)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
