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 9, 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-1986-9201

Citation: Fundamenta Informaticae, vol. 9, no. 2, pp. i-vi, 1986

Get PDF

Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra

Authors: Baeten, J.C.M. | Bergstra, J.A. | Klop, J.W.

Article Type: Research Article

Abstract: A mechanism is introduced to describe priorities in ACP, the algebra of communicating processes, whereby some actions have priority over others in a non-deterministic choice (or sum). This mechanism can be used to model the working of interrupts in a distributed system. This is illustrated in an extensive example.

Keywords: concurrency, process algebra, interrupts, priorities

DOI: 10.3233/FI-1986-9202

Citation: Fundamenta Informaticae, vol. 9, no. 2, pp. 127-167, 1986

Price: EUR 27.50

An Assessment of Programming Styles: Assignment-Oriented Languages Versus Functional and Applicative Languages

Authors: Broy, Manfred

Article Type: Research Article

Abstract: Three small programming languages are introduced: a procedural one, an applicative one and a functional one (here functional is always meant in the sense of “functional in the style of Backus”). For each of them mathematical (denotational) and operational semantics are defined. Then the similarities and differences between these three languages with respect to mathematical semantics, operational semantics, syntactic and notational properties are discussed in detail. Specific attention is paid to the notion of program variable

DOI: 10.3233/FI-1986-9203

Citation: Fundamenta Informaticae, vol. 9, no. 2, pp. 169-204, 1986

Price: EUR 27.50

Type Independent Varieties and Metric Equivalence of Tree Automata

Authors: Ésik, Zoltán | Gécseg, Ferenc

Article Type: Research Article

DOI: 10.3233/FI-1986-9204

Citation: Fundamenta Informaticae, vol. 9, no. 2, pp. 205-216, 1986

Price: EUR 27.50

The Weakest Prespecification, Part II

Authors: Hoare, C.A.R. | Jifeng, He

Article Type: Research Article

DOI: 10.3233/FI-1986-9205

Citation: Fundamenta Informaticae, vol. 9, no. 2, pp. 217-251, 1986

Price: EUR 27.50
Show more