On the Number of Membranes in Unary P Systems
Formal Languages and Automata Theory
2009-07-30 v1
Abstract
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems allows for a unique minimal representation of the generated unary language and in that way for an effective solution of the equivalence problem. Moreover, we examine the descriptional complexity of unary P systems with respect to the number of membranes.
Keywords
Cite
@article{arxiv.0907.5120,
title = {On the Number of Membranes in Unary P Systems},
author = {Rudolf Freund and Andreas Klein and Martin Kutrib},
journal= {arXiv preprint arXiv:0907.5120},
year = {2009}
}