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 10, issue 4

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-1987-10401

Citation: Fundamenta Informaticae, vol. 10, no. 4, pp. i-vii, 1987

Get PDF

Concurrent Program Schemes

Authors: Kfoury, A.J. | Urzyczyn, P.

Article Type: Research Article

Abstract: We study the programming formalism FD of “flow-diagrams” to which we gradually add various features of concurrency. The weakest form of concurrency is introduced by the construct “and”, which is dual to the nondeterministic choice “or” and plays a role similar to universal states in alternating Turing machines. Stronger (and more realistic) forms of concurrency are obtained when processes are allowed to communicate. We consider communication by channels and communication by messages. We calibrate the computational power of classes of concurrent programs FD+α against that of sequential programs, where α is the addition of one of the following … Show more

DOI: 10.3233/FI-1987-10402

Citation: Fundamenta Informaticae, vol. 10, no. 4, pp. 337-361, 1987

Price: EUR 27.50

Decomposition of Transformation Groups of Permutation Machines

Authors: Niemenmaa, Markku

Article Type: Research Article

Abstract: By a permutation machine we mean a triple (Q,S,F), where Q and S are finite sets and F is a function Q × S → Q which defines a permutation on Q for every element from S. These permutations generate a permutation group G and by considering the structure of G we can obtain efficient ways to decompose the transformation group (Q,G). In this paper we first consider the situation where G is half-transitive and after this we show how to use our result in the general non-transitive case.

DOI: 10.3233/FI-1987-10403

Citation: Fundamenta Informaticae, vol. 10, no. 4, pp. 363-367, 1987

Price: EUR 27.50

On Growing Automata and Random Environments

Authors: Barel, A.

Article Type: Research Article

DOI: 10.3233/FI-1987-10404

Citation: Fundamenta Informaticae, vol. 10, no. 4, pp. 369-385, 1987

Price: EUR 27.50

Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science

Authors: Guessarian, Irène

Article Type: Research Article

Abstract: This paper recalls some fixpoint theorems in ordered algebraic structures and surveys some ways in which these theorems are applied in computer science. We describe via examples three main types of applications: in semantics and proof theory, in logic programming and in deductive data bases.

DOI: 10.3233/FI-1987-10405

Citation: Fundamenta Informaticae, vol. 10, no. 4, pp. 387-413, 1987

Price: EUR 27.50

A Generalization of Finite Automata

Authors: Wiśniewski, Kazimierz

Article Type: Research Article

DOI: 10.3233/FI-1987-10406

Citation: Fundamenta Informaticae, vol. 10, no. 4, pp. 415-435, 1987

Price: EUR 27.50
Show more