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 2, issue 1

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

SOL: an exercise in defining a language

Authors: Maggiolo-Schettini, A. | Uccella, G.

Article Type: Research Article

Abstract: A language for operation on a stack (SOL) is defined formally, also from the semantic point of view. The semantics is an input-output semantics which uses functions from sequences (of integers) of indefinite length to sequences (of integers) of indefinite length as models of the computation on a stack. The programs in SOL are interpreted in recursive systems of functional definitions to which fixed point theory easily applies in order to evaluate the functions computed by the programs. The language has been implemented and used for didactic purposes.

Keywords: Programming languages, stack functions fixed point semantics

DOI: 10.3233/FI-1978-2121

Citation: Fundamenta Informaticae, vol. 2, no. 1, pp. 337-349, 1978

Price: EUR 27.50

Query language of stochastic information systems

Authors: Konikowska, Beata | Traczyk, Tadeusz

Article Type: Research Article

Abstract: For a class of stochastic information systems a query language is defined and the completeness property proved. It is also shown that each term may be transformed into a canonical form, and in some special case into a normal additive form.

Keywords: information storage and retrieval, query language, Boolean numerical algebra, stochastic information, normal form, completeness property

DOI: 10.3233/FI-1978-2122

Citation: Fundamenta Informaticae, vol. 2, no. 1, pp. 351-363, 1978

Price: EUR 27.50
Show more