On generating trees by P systems with active membranes
25 Sep 2005-pp 462-466
TL;DR: It is proved that each recursively enumerable tree language can be obtained by this P systems with membrane creation working with symbol objects.
Abstract: In this paper, we consider P systems with membrane creation working with symbol objects. As a result of a halting computation we do not take the set of numbers generated in a designated output membrane, instead we take the resulting tree representing the membrane structure of the final configuration. We prove that each recursively enumerable tree language can be obtained by this system.
Citations
More filters
02 Jun 2008
TL;DR: This work discusses in a certain detail the possibility of using membrane computing as a high level computational modeling framework for addressing structural and dynamical aspects of cellular systems.
Abstract: Membrane computing is a branch of natural computing aiming to abstract computing models from the structure and functioning of the living cell, and from the way cells cooperate in tissues, organs, or other populations of cells. This research area developed very fast, both at the theoretical level and in what concerns the applications. After a very short description of the domain, we mention here the main areas where membrane computing was used as a framework for devising models (biology and bio-medicine, linguistics, economics, computer science, etc.), then we discuss in a certain detail the possibility of using membrane computing as a high level computational modeling framework for addressing structural and dynamical aspects of cellular systems. We close with a comprehensive bibliography of membrane computing applications.
32 citations
01 Jan 2007
TL;DR: The present notes intend to survey the research related to some of the problems of membrane computing, mentioning both progresses made in solving them and questions which still wait for research efiorts.
Abstract: Membrane computing is a branch of natural computing aiming to abstract computing models from the structure and functioning of the living cell, and from the way cells cooperate in tissues, organs, or other populations of cells. This research area developed very fast, both at the theoretical level and in what concerns the applications. During the almost ten years since membrane computing was initiated, several open problems were circulated, sometimes in comprehensive lists prepared for meetings in this area. The present notes intend to survey the research related to some of these problems, mentioning both progresses made in solving them and questions which still wait for research efiorts.
26 citations
Cites background from "On generating trees by P systems wi..."
..., [21], [31], [53]), but it still deserves further efforts....
[...]
25 Sep 2005
TL;DR: A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural operational semantics.
Abstract: A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural operational semantics. This approach investigates a generic strategy of selecting membranes and rules and applying the rules. P systems with boundary rules are used to illustrate the case and an example dealing with an evolution strategy involving bounded parallelism is discussed.
16 citations
01 Jan 2010
TL;DR: It is proved that guided rewriting preserves regularity: for every regular language its closure under guided rewriting is regular too.
Abstract: Inspired by RNA-editing as occurs in transcriptional processes in the living cell, we introduce an abstract notion of string adjustment, called guided rewriting. This formalism allows simultaneously inserting and deleting elements. We prove that guided rewriting preserves regularity: for every regular language its closure under guided rewriting is regular too. This contrasts an earlier abstraction of RNA-editing separating insertion and deletion for which it was proved that regularity is not preserved. The particular automaton construction here relies on an auxiliary notion of slice sequence which enables to sweep from left to right through a completed rewrite sequence.
3 citations
Cites background or methods from "On generating trees by P systems wi..."
...The instantiation involves the adoption of PALPS logical expr ssions as the atomic propositions of the 18 logic....
[...]
...…an amorphous programming language as Proto [3] or a language for dynamical systems with dynamical structures as MGS [15], and ending by a structural description programmed in a grammar based 41 language, GUBS language occupies the intermediary level dedicated to cell entity behavioural programming....
[...]
...In this endeavour, the computeraided-design (CAD) environments play a central role by providing the required features to engineer systems: specification, analysis, and tuning [4, 20, 25, 12]....
[...]
...Movement in the calculus is modeled via a specialized action whose effect is to change the location of an individual, with the restriction that the originating and the destination locations are neighboring locations....
[...]
...Although the sequence description is necessary, the programmer must previously anticipate the behaviour of the device to conceive....
[...]
Posted Content•
TL;DR: This volume represents the proceedings of the 5th Workshop on Membrane Computing and Biologically Inspired Process Calculi (MeCBIC 2011), held together with the 12th International Conference on MemBRane Computing on 23rd August 2011 in Fontainebleau, France.
Abstract: This volume represents the proceedings of the 5th Workshop on Membrane Computing and Biologically Inspired Process Calculi (MeCBIC 2011), held together with the 12th International Conference on Membrane Computing on 23rd August 2011 in Fontainebleau, France.
1 citations
References
More filters
TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.
2,327 citations
Book•
01 Jan 2002
TL;DR: This chapter discusses Membrane Computing, What It Is and What It is Not, and attempts to get back to reality with open problems and Universality results.
Abstract: Preface.- 1. Introduction: Membrane Computing, What It Is and What It Is Not.- 2. Prerequisites.- 3. Membrane Systems with Symbol-Objects.- 4. Trading Evolution for Communication.- 5. Structuring Objects.- 6. Networks of Membranes.- 7. Trading Space for Time.- 8. Further Technical Results.- 9. (Attempts to Get) Back to Reality.- Open Problems.- Universality Results. Bibliography.- Index.
1,760 citations
Book•
01 Jan 1989
TL;DR: This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies, as well as selective substitution grammars as one common generalization.
Abstract: It is well-known that context-free grammars cannot cover all aspects of natural languages, progamming languages and other related fields. Therefore a lot of mechanisms have been introduced which control the application of context-free rules. This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies. Matrix, programmed, and random context grammars as typical representants are studied in more detail. Besides their algebraic and decidability properties a comparison is made with respect to syntactic complexity measures and pure versions. Further topics are combinations of some control mechanisms, regulated L systems, automata characterizations, Szilard languages, and grammar forms of regulated grammars as well as selective substitution grammars as one common generalization.
847 citations
TL;DR: It is proved that recursively enumerable languages can be generated by matrix grammars with only two non-terminal symbols being used in the appearance checking mode, and three classes of membrane systems are considered, and in all the three cases the hierarchies are shown to collapse at level four.
35 citations
14 Jun 2004
TL;DR: Each recursively enumerable tree language can be obtained in that way generated by P systems with active membranes working on strings by considering the resulting tree representing the membrane structure of the final configuration.
Abstract: We consider P systems with active membranes, but without polarizations, yet with using membrane division and membrane generation, but as the result of a halting computation we do not take the terminal string generated in a designated output membrane, instead we consider the resulting tree representing the membrane structure of the final configuration as its result. We show that each recursively enumerable tree language can be obtained in that way generated by P systems with active membranes working on strings.
11 citations
"On generating trees by P systems wi..." refers methods in this paper
...These features are used in defining transitions between configurations of the system, and sequence of transitions are used to define computations....
[...]