Sequential p systems with regular control

Authors:
Artiom Alhazov;Rudolf Freund;Hilbert Heikenwälder;Marion Oswald;Yurii Rogozhin;Sergey Verlan
Affiliations:
Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău, Moldova, Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi d ...;Faculty of Informatics, Vienna University of Technology, Vienna, Austria;Faculty of Informatics, Vienna University of Technology, Vienna, Austria;Faculty of Informatics, Vienna University of Technology, Vienna, Austria;Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău, Moldova;LACL, Département Informatique, Université Paris Est, Créteil, France
Venue:
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Year:
2012

Citing 14
Cited 0

Grammars with controlled derivations

Handbook of formal languages, vol. 2
Grammar systems

Handbook of formal languages, vol. 2
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Subregularly controlled derivations: restrictions by syntactic parameters

Where mathematics, computer science, linguistics and biology meet
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction

Membrane Computing: An Introduction
DNA Computing: Distributed Splicing Systems

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Toward a Formal Macroset Theory

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
About Time-Varying Distributed H Systems

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Computationally universal P systems without priorities: two catalysts are sufficient

Theoretical Computer Science - Descriptional complexity of formal systems
Computation: finite and infinite machines

Computation: finite and infinite machines
Multiset random context grammars, checkers, and transducers

Theoretical Computer Science
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we introduce the regulating mechanism of control languages for the application of rules assigned to the membranes of a sequential P system and the variant of time-varying sets of rules available at different transition steps. Computational completeness can only be achieved when allowing the system to have no rules applicable for a bounded number of steps; in this case we only need one membrane and periodically available sets of non-cooperative rules, i.e., time-varying sequential P systems. On the other hand, even with an arbitrary number of membranes and regular control languages, only Parikh sets of matrix languages can be obtained if the terminal result has to be taken as soon as the system cannot apply any rule anymore.