32 research outputs found
Recommended from our members
P colonies and kernel P systems
YesP colonies, tissue-like P systems with very simple components, have received constant attention from the membrane computing community and in the last years several new variants of the model have been considered. Another P system model, namely kernel P system, integrating the most successfully used features of membrane systems, has recently attracted interest and some important developments have been reported. In this paper we study connections among several classes of P colonies and kernel P systems, by showing how the behaviour of these P colony systems can be represented as kernel P systems. An example illustrates the way it is modelled by using P colonies and kernel P systems and some properties of it are formally proved in the latter approach.Grant No. K 120558 of the NKFIH—National Research, Development, and Innovation Office, Hungary; Romanian National Authority for Scientific Research, CNCS-UEFISCDI (Project No. PN-III-P4-ID-PCE-2016-0210)
Further results on generalised communicating P systems
YesIn this paper we consider four restricted cases of the generalised communicating P systems and
study their computational power, by providing improved results, with respect to the number
of compartments involved. We illustrate the expressive power of these devices by modelling
several problems, such as producer/consumer, work
ow patterns, broadcasting problem and
comparative operations. We also present some relationships between generalised communicating P systems and P colonies, tissue-like P systems with very simple components.MG and FI were supported by a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI, project number PN-II-ID-PCE-2011-3-0688, CSVE by grant No. 120558 of the National Research, Development, and Innovation Office, Hungary
A new class of symbolic abstract neural nets
Starting from the way the inter-cellular communication takes place by means of protein channels and also from the standard knowledge about neuron functioning, we propose a computing model called a tissue P system, which processes symbols in a multiset rewriting sense, in a net of cells similar to a neural net. Each cell has a finite state memory, processes multisets of symbol-impulses, and can send impulses (?excitations?) to the neighboring cells. Such cell nets are shown to be rather powerful: they can simulate a Turing machine even when using a small number of cells, each of them having a small number of states. Moreover, in the case when each cell works in the maximal manner and it can excite all the cells to which it can send impulses, then one can easily solve the Hamiltonian Path Problem in linear time. A new characterization of the Parikh images of ET0L languages are also obtained in this framework
PNEPs, NEPs for context free parsing: Application to natural language processing
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-02478-8_59Proceedings of 10th International Work-Conference on Artificial Neural Networks, IWANN 2009, Salamanca, Spain.This work tests the suitability of NEPs to parse languages. We propose PNEP, a simple extension to NEP, and a procedure to translate a grammar into a PNEP that recognizes the same language. These parsers based on NEPs do not impose any additional constrain
to the structure of the grammar, which can contain all kinds of recursive, lambda or ambiguous rules. This flexibility makes this procedure specially suited for Natural Languge Processing (NLP). In a first proof with a simplified English grammar, we got a performance (a linear time complexity) similar to that of the most popular syntactic parsers in the NLP area (Early and its derivatives). All the possible derivations for ambiguous grammars were generatedThis work was partially supported by MEC, project TIN2008-02081/TIN and by DGUI CAM/UAM, project CCG08-UAM/TIC-4425
Site-Directed Insertion: Decision Problems, Maximality and Minimality
Site-directed insertion is an overlapping insertion operation that can be
viewed as analogous to the overlap assembly or chop operations that concatenate
strings by overlapping a suffix and a prefix of the argument strings. We
consider decision problems and language equations involving site-directed
insertion. By relying on the tools provided by semantic shuffle on trajectories
we show that one variable equations involving site-directed insertion and
regular constants can be solved. We consider also maximal and minimal variants
of the site-directed insertion operation
Computing with cells: membrane systems - some complexity issues.
Membrane computing is a branch of natural computing which abstracts computing models from the structure and the functioning of the living cell. The main ingredients of membrane systems, called P systems, are (i) the membrane structure, which consists of a hierarchical arrangements of membranes which delimit compartments where (ii) multisets of symbols, called objects, evolve according to (iii) sets of rules which are localised and associated with compartments. By using the rules in a nondeterministic/deterministic maximally parallel manner, transitions between the system configurations can be obtained. A sequence of transitions is a computation of how the system is evolving. Various ways of controlling the transfer of objects from one membrane to another and applying the rules, as well as possibilities to dissolve, divide or create membranes have been studied. Membrane systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems once future biotechnology gives way to a practical bio-realization. In this paper we survey some interesting and fundamental complexity issues such as universality vs. nonuniversality, determinism vs. nondeterminism, membrane and alphabet size hierarchies, characterizations of context-sensitive languages and other language classes and various notions of parallelism
Emergent organisation in colonies of simple automata.
We have simulated a colony of approx 3000 simple automata, with interaction behaviours that attempt to emulate those observed in stromatolite building microbes. The colony is able to maintain a diverse genome that can metabolise large quantities of up to 100 different food types simultaneously. Group organisations that process short lived food types more rapidly than others readily emerge under the correct conditions. We have applied the lessons to the control and management of a distributed communications system