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 180, 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.

Causal Semantics for BPP Nets with Silent Moves

Authors: Gorrieri, Roberto

Article Type: Research Article

Abstract: BPP nets, a subclass of finite Place/Transition Petri nets, are equipped with some causal behavioral semantics, which are variations of fully-concurrent bisimilarity [3], inspired by weak [28] or branching bisimulation [12] on labeled transition systems. Then, we introduce novel, efficiently decidable, distributed semantics, inspired by team bisimulation [17] and h-team bisimulation [19], and show how they relate to these variants of fully-concurrent bisimulation.

Keywords: Petri nets, BPP, Causality, Team bisimulation, Weak and branching bisimulation

DOI: 10.3233/FI-2021-2039

Citation: Fundamenta Informaticae, vol. 180, no. 3, pp. 179-249, 2021

Price: EUR 27.50

A Dynamical System Approach to Polyominoes Generation

Authors: Massazza, Paolo

Article Type: Research Article

Abstract: We describe a method which exploits discrete dynamical systems to generate suitable classes of polyominoes. We apply the method to design an algorithm that uses O (n ) space to generate in constant amortized time all polyominoes corresponding to hole-free partially directed animals consisting of n sites on the square grid. By implementing the algorithm in C++ we have obtained a new sequence that does not appear in the On-Line Encyclopedia of Integer Sequences.

Keywords: partially directed animals, polyominoes, exhaustive generation, algorithms, discrete dynamical systems

DOI: 10.3233/FI-2021-2040

Citation: Fundamenta Informaticae, vol. 180, no. 3, pp. 251-273, 2021

Price: EUR 27.50

Place the Vertices Anywhere on the Curve and Simplify

Authors: Rudi, Ali Gholami

Article Type: Research Article

Abstract: A polygonal curve is simplified to reduce its number of vertices, while maintaining similarity to its original shape. Numerous results have been published for vertex-restricted simplification, in which the vertices of the simplified curve are a subset of the vertices of the input curve. In curve-restricted simplification, i.e. when the vertices of the simplified curve are allowed to be placed on the edges of the input curve, the number of vertices may be much more reduced. In this paper, we present algorithms for computing curve-restricted simplifications of polygonal curves under the local Hausdorff distance measure.

Keywords: Curve simplification, geometric algorithms, computational geometry

DOI: 10.3233/FI-2021-2041

Citation: Fundamenta Informaticae, vol. 180, no. 3, pp. 275-287, 2021

Price: EUR 27.50
Show more