Computer Science – Formal Languages and Automata Theory
Scientific paper
2009-07-29
EPTCS 3, 2009, pp. 101-109
Computer Science
Formal Languages and Automata Theory
Scientific paper
10.4204/EPTCS.3.9
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.
Freund Rudolf
Klein Andreas
Kutrib Martin
No associations
LandOfFree
On the Number of Membranes in Unary P Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Number of Membranes in Unary P Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Number of Membranes in Unary P Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-521636