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 7, issue 3

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.

results per page

A Formal System for Proving Some Properties of Programs in Iterative Combinatory Spaces

Authors: Skordev, Dymiter

Article Type: Research Article

Abstract: The paper presents an abstract tool for describing general properties of programs. Iterative combinatory space approach makes possible to transfer recursion – theoretical methods onto logical system which is constructed in this paper.

Keywords: Iterative combinatory space, normal form theorem

DOI: 10.3233/FI-1984-7311

Citation: Fundamenta Informaticae, vol. 7, no. 3, pp. 359-365, 1984

Price: EUR 27.50

On P – Normal Form of Parallel Program

Authors: Stapp, Lucjan

Article Type: Research Article

Abstract: In the last few years parallel programs are intensively studied. But when parallel program is investigated, it is assumed, that only one “cobegin … coend ” (“fork … join”) operation is used (see e.g. [1,2]) in the program schemata. In the paper we introduce the notion of the equivalence relation between parallel programs and then it is proved that it is sufficient to study properties of parallel programs only with one “cobegin … coend ” program connective.

Keywords: equivalence of parallel programs, normal form of parallel programs

DOI: 10.3233/FI-1984-7312

Citation: Fundamenta Informaticae, vol. 7, no. 3, pp. 367-376, 1984

Price: EUR 27.50

On an Application of Algorithmic Theory of Stacks

Authors: Szałas, Andrzej

Article Type: Research Article

Abstract: The fact that for every formula describing properties of programs with recursive functions there exists an equivalent while -formula with stacks is proved in a constructive way. This implies the possibility of using the algorithmic theory of stacks to prove the properties of ALGOL-like programs. The normal forms for such programs are also defined.

Keywords: algorithmic logic, algorithmic theory, block-structured program, interpretation of theories, normal forms for programs, recursive functions, relational system, translation

DOI: 10.3233/FI-1984-7313

Citation: Fundamenta Informaticae, vol. 7, no. 3, pp. 377-388, 1984

Price: EUR 27.50
Show more