You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Fundamenta Informaticae - Volume 11, issue 2

Purchase individual online access for 1 year to this journal.

Price: EUR 410.00
ISSN 0169-2968 (P)
ISSN 1875-8681 (E)

Impact Factor 2024: 0.4

Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:


- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.

Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.

Table of Contents

Article Type: Other

DOI: 10.3233/FI-1988-11201

Citation: Fundamenta Informaticae, vol. 11, no. 2, pp. i-vi, 1988

Get PDF

Free Net Algebras in VLSI-Theory

Authors: Molitor, Paul

Article Type: Research Article

Abstract: We provide a simple and uniform calculus of networks which allows us to treat both functional and structural properties of the circuits. By factorizing the algebras according to suitable relations, we obtain representations of integrated circuits on different design levels. With that, we give complete characterizations of these levels, i.e., expressions describing the same net with respect to a certain level can be transformed into each other by applying the corresponding rules.

DOI: 10.3233/FI-1988-11202

Citation: Fundamenta Informaticae, vol. 11, no. 2, pp. 117-141, 1988

Price: EUR 27.50

Bases and Lattices in Non-Sequential Processes

Authors: Fernández C., Cesar | Merceron, Agathe

Article Type: Research Article

Abstract: In this paper, we introduce the notion of a basis to study non-sequential processes which are modelled by partially ordered sets. We show that -associated to lower sets and upper sets- this notion permits to characterise several properties of non-sequential processes. We show also that lower sets and upper sets with finite basis are the compact elements of the lattices of lower sets and upper sets.

DOI: 10.3233/FI-1988-11203

Citation: Fundamenta Informaticae, vol. 11, no. 2, pp. 143-169, 1988

Price: EUR 27.50

An Algebraic Characterization of Concurrent Systems

Authors: Korczyński, Waldemar

Article Type: Research Article

Abstract: In the paper a characterization of concurrent systems as algebras of a special kind is given. The algebras are defined by semi-equations in the first order language.

DOI: 10.3233/FI-1988-11204

Citation: Fundamenta Informaticae, vol. 11, no. 2, pp. 171-193, 1988

Price: EUR 27.50

A Complexity Theoretic Parade of Network-Flow-Problems

Authors: Meinel, Christoph

Article Type: Research Article

Abstract: In the following we prove the p-projection completeness of a number of extremely restricted modifications of the NETWORK-FLOW-PROBLEM for such well known nonuniform complexity classes like NC 1 , L , NL , co-NL , P , NP using a branching-program based characterization of these classes given in [Ba86] and [Me86a,b].

DOI: 10.3233/FI-1988-11205

Citation: Fundamenta Informaticae, vol. 11, no. 2, pp. 195-208, 1988

Price: EUR 27.50

Logic Programming on a Topological Bilattice

Authors: Fitting, Melvin

Article Type: Research Article

Abstract: We investigate the semantics of logic programming using a generalized space of truth values. These truth values may be thought of as evidences for and against – possibly incomplete or contradictory. The truth value spaces we use essentially have the structure of M. Ginsberg’s bilattices, and arise from topological spaces. The simplest example is a four-valued logic, previously investigated by N. Belnap. The theory of this special case properly contains that developed in earlier research by the author, on logic programming using Kleene’s three-valued logic.

DOI: 10.3233/FI-1988-11206

Citation: Fundamenta Informaticae, vol. 11, no. 2, pp. 209-218, 1988

Price: EUR 27.50
Show more