Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 410.00Impact 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.
Authors: Ceterchi, Rodica | Gramatovici, Radu | Jonoska, Nataša | Subramanian, K.G.
Article Type: Research Article
Abstract: We propose a variant of tissue-like P systems with symport rules and active membranes that generates two-dimensional picture languages. The method is unconventional in that, instead of using the membranes as regions for computation/writing, it uses them to hold elements of pictures. Thus, the picture itself, and actually the whole supporting rectangular grid, is composed of membranes, each one containing (among other symbols) a letter of the picture's alphabet. The method is illustrated by its application …to the generation of local and recognizable picture languages. Show more
Keywords: membrane computing, local picture languages, tiling systems
Citation: Fundamenta Informaticae, vol. 56, no. 4, pp. 311-328, 2003
Authors: Dunin-Keplicz, Barbara | Verbrugge, Rineke
Article Type: Research Article
Abstract: In this paper we aim to describe dynamic aspects of social and collective attitudes in teams of agents involved in Cooperative Problem Solving (CPS). Particular attention is given to the strongest motivational attitude, collective commitment, and its evolution during team action. First, building on our previous work, a logical framework is sketched in which a number of relevant social and collective attitudes is formalized, leading to the plan-based definition of collective commitments. Moreover, a dynamic logic …component is added to this framework in order to capture the effects of the complex actions that are involved in the consecutive stages of CPS, namely potential recognition, team formation, plan formation and team action. During team action, the collective commitment leads to the execution of agent-specific actions. A dynamic and unpredictable environment may, however, cause the failure of some of these actions, or present the agents with new opportunities. The abstract reconfiguration algorithm, presented in a previous paper, is designed to handle the re-planning needed in such situations in an efficient way. In this paper, the dynamic logic component of the logical framework addresses issues pertaining to adjustments in collective commitment during the reconfiguration process. Show more
Keywords:
Citation: Fundamenta Informaticae, vol. 56, no. 4, pp. 329-371, 2003
Authors: Terlikowski, Tomasz
Article Type: Research Article
Abstract: In this paper, we deal with systems S including set theory. The concept of an elementary description was introduced in [11] as an auxiliary notion. Such a notion occurs to be necessary to define risk function and risk-type description, that will be subject of the next part of this work. The present paper is a continuation of our research in [13], [14] and [15]; the reader will find all relevant notions in the quoted works.
Citation: Fundamenta Informaticae, vol. 56, no. 4, pp. 373-387, 2003
Authors: Truthe, Bianca
Article Type: Research Article
Abstract: In the present paper, synchronous, simple non-deterministic chain code picture systems based on Lindenmayer systems (sOL systems) are studied with respect to the finiteness of their picture languages. The finiteness is proved to be decidable. Additionally, a method is given for deciding whether an sOL system generates a finite picture language or not.
Keywords: chain code picture systems, Lindenmayer systems
Citation: Fundamenta Informaticae, vol. 56, no. 4, pp. 389-409, 2003
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]