X-machines as a basis for dynamic system specification
Software Engineering Journal
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Journal of Computer and System Sciences
Automata, Languages, and Machines
Automata, Languages, and Machines
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
The Bhopalator: an information/energy dual model of the living cell (II)
Fundamenta Informaticae - Membrane computing
Formal Modelling of Reactive Agents as an Aggregation of Simple Behaviours
SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
PX systems = P systems + X machines
Natural Computing: an international journal
Testing against a non-controllable stream X-machine using state counting
Theoretical Computer Science
Testing data processing-oriented systems from stream X-machine models
Theoretical Computer Science
Hybrid architecture based on support vector machines
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
| Hi-index | 0.00 |
A class of P systems, called EP systems, with string objects processed by evolution rules distributed alongside the transitions of an Eilenberg machine, is introduced. A parallel variant of EP systems, called EPP systems, is also defined and the power of both EP and EPP systems is investigated in relationshipwith three parameters: number of membranes, states and set of distributed rules. It is shown that EPP systems represent a promising framework for solving NP-complete problems. In particular linear time solutions are provided for the SAT problem.