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

results per page

Information Dynamics of Cellular Automata I – An Algebraic Study

Authors: Nishio, Hidenosuke | Saito, Takashi

Article Type: Research Article

Abstract: Information dynamics of cellular automata(CA) is studied using polynomials over finite fields. The information about the uncertainty of cell states is expressed by an indeterminate X called information variable and its dynamics is investigated by extending CA to CA[X] whose cell states are polynomials in X. For the global configuration of extended CA[X], new notions of completeness and degeneracy are defined and their dynamical properties are investigated. A theorem is proved that completeness equals non-degeneracy. With … Show more

Keywords: cellular automaton, polynomials over finite fields, dynamical system, completeness, degeneracy, reversibility

Citation: Fundamenta Informaticae, vol. 58, no. 3-4, pp. 399-420, 2003

Price: EUR 27.50

Real-Time Generation of Primes by a 1-Bit-Communication Cellular Automaton

Authors: Umeo, Hiroshi | Kamikawa, Naoki

Article Type: Research Article

Abstract: It is shown that an infinite prime sequence can be generated in real-time by a cellular automaton having 1-bit inter-cell communications (CA_{1-bit}). The algorithm presented is based on the classical sieve of Eratosthenes, and its implementation will be made on a CA_{1-bit} using 34 internal states and 71 transition rules.

Keywords: cellular automaton, 1-bit inter-cell communication, real-time prime generation algorithm, sieve of Eratosthenes

Citation: Fundamenta Informaticae, vol. 58, no. 3-4, pp. 421-435, 2003

Price: EUR 27.50
Show more