Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
On P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
On the power of membrane division in P systems
Theoretical Computer Science - Words, languages and combinatorics
Identifying p rules from membrane structures with an error-correcting approach
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Editing distances between membrane structures
WMC'05 Proceedings of the 6th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Inference of reversible tree languages
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Translating Multiset Tree Automata into P Systems
Membrane Computing
| Hi-index | 0.00 |
The relation between the membrane structures of P systems and an extension of tree automata which introduces multisets in the transition function has been proposed in previous works. Here we propose two features of tree automata which have been previously studied (namely, reversibility and local testability) in order to extend them to multiset tree automata. The characterization of these families will introduce a new characterization of membrane structures defined by the set of rules used for membrane creation and deletion.