PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  natural computing
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Enforcing Regular Languages
Genova D., Hoogeboom H. J.
Fundamenta Informaticae
|
2017
|
Vol. 154, nr 1/4
131--144
EN
We investigate regular languages in the context of the forbidding-enforcing systems introduced by Ehrenfeucht and Rozenberg in the variant where one fe-system defines a single language. In general, these systems may have infinite sets of rules, allowing one to define arbitrary languages. On the other hand when restricted to finite sets, one obtains a strict subclass of the regular languages, between the strictly locally testable and locally testable languages. We further investigate classes of enforcing systems that characterize the regular languages. These systems have infinite sets of enforcers, but can be defined using regular languages (finite state automata).
2
Reaction systems with precipitation
Rogalski M.
Journal of Theoretical and Applied Computer Science
|
2015
|
Vol. 9, nr 4
26--34
EN
This article proposes expanding Reaction Systems of Ehrenfeucht and Rozenberg by incorporating precipitation reactions into it. This improves the computing power of Reaction Systems by allowing us to implement a stack. This addition enables us to implement a Deterministic Pushdown Automaton.
3
Content available A new optimization algorithn based on a paradigm inspired by nature
Astudillo L., Melin P., Castillo O.
Journal of Automation Mobile Robotics and Intelligent Systems
|
2011
|
Vol. 5, No. 1
95-100
EN
In this paper, we propose a new optimization algorithm for soft computing problems, which is inspired on a nature paradigm: the reaction methods existing on chemistry, and the way the elements combine with each other to form compounds, in other words, quantum chemistry. This paper is the first approach for the proposed method, and it presents the background, main ideas, desired goals and preliminary results in optimization.
4
Content available remote Membrane Systems with Qualitative Evolution Rules
Kleijn J., Koutny M.
Fundamenta Informaticae
|
2011
|
Vol. 110, nr 1-4
217-230
EN
In membrane systems, biochemical reactions taking place in the compartments of a cell are abstracted to evolution rules that specify which and how many objects are consumed and produced. The recently proposed reaction systems also investigate processes carried by biochemical reactions, but the resulting computational model is remarkably different. A key difference is that in reaction systems, biochemical reactions are modeled using a qualitative rather than a quantitative approach. In this paper, we introduce so-called set membrane systems, a variant of membrane systems with qualitative evolution rules inspired by reaction systems. We then relate set membrane systems to Petri nets which leads to a new class of Petri nets: set-nets with localities. This Petri net model provides a faithful match with the operational semantics of set membrane systems.
5
Content available remote 5'→3' Watson-Crick AutomataWith Several Runs
Leupold P., Nagy B.
Fundamenta Informaticae
|
2010
|
Vol. 104, nr 1/2
71-91
EN
5'→3' WK-automata are Watson-Crick automata whose two heads start on opposite ends of the input word and always run in opposite directions. One full reading in both directions is called a run. We prove that the expressive power of these automata increases with every additional run that they can make, both for deterministic and non-deterministic machines. This defines two incomparable infinite hierarchies of language classes between the regular and the context-sensitive languages. These hierarchies are complemented with classes defined by several restricted variants of 5'→3' WK-automata like stateless automata. Finally we show that several standard problems are undecidable for languages accepted by 5'→3' WK-automata in only one run, for example the emptiness and the finiteness problems.
6
Content available remote Zastosowanie sieci komórkowych do wykrywania konturów w obrazach medycznych
Chen Z.
Przegląd Elektrotechniczny
|
2009
|
R. 85, nr 4
56-58
PL
Artykuł przedstawia teoretyczne i praktyczne aspekty sieci komórkowych w zastosowaniu do wykrywania konturów w obrazach medycznych. Na podstawie obrazu wycinka skóry zwierzęcej przedstawiono i przedyskutowano różne aspekty metodologii obliczeń naturalnych przy użyciu sieci komórkowych.
EN
There is a strong need for integrated study of both theoretical and practical aspects of cellular automata (CA). In this article we report our ongoing work of exploring the nature of CA through an experimental study, focusing on an application of CA for edge detection in medical images. Through an example we describe the algorithm developed, followed by a discussion. The main theme of this paper is to advocate a thorough analysis of the methodology in the context of natural computing. We also point out the indication of such integrated study to education.
7
Content available remote Simulating Turing Machines by P Systems with External Output
Romero-Jiménez A., Pérez-Jiménez M.J.
Fundamenta Informaticae
|
2002
|
Vol. 49, nr 1-3
273-287
EN
In [3] a variant of the computation model introduced by Gh. Pun in [1] is considered: membrane systems with external output, which were proven to be universal, in the sense that they are able to generate all Parikh images of recursively enumerable languages. Here we give another proof of the universality of this model. The proof is carried out associating to each deterministic Turing machine a P system with external output that simulates its running. Thus, although we work with symbol-objects, we get strings as a result of computations, and in this way we generate directly all recursively enumerable languages, instead of their images through Parikh mapping, as it is done in [3].
8
Content available remote A Formalization of Transition P Systems
Jiménez M.J., Sancho-Caparrini F.
Fundamenta Informaticae
|
2002
|
Vol. 49, nr 1-3
261-272
EN
In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: transition P systems as they were given in [3], addressed with completely different techniques than in [1] and [2]. For this, we present a formal syntax and semantic of the transition P systems capturing the synchronized work of P systems, and the nondeterministic and maximally parallel manner in which the rules of these systems can be applied.
9
Content available remote Membrane computing with external output
Paun G., Rozenberg G., Salomaa A.
Fundamenta Informaticae
|
2000
|
Vol. 41, Nr 3
313-340
EN
A membrane computing system (also called P system) consists of computing cells which are organized hierarchically by the inclusion relation: cells may include cells, which again may include cells, etc. Each cell is enclosed by its membrane. Each cell is an independent computing agent with its own computing program, which produces objects. The interaction between cells consists of the exchange of objects through membranes. The output of a computation is a partially ordered set of objects which leave the system through its external membrane. The fundamental properties of computations in such P systems with external output are investigated. These include the computing power, normal forms, and basic decision problems.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.