On the Number of Membranes in Unary P Systems
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...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2009-07-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/0907.5120v1 |
_version_ | 1818211512944164864 |
---|---|
author | Rudolf Freund Andreas Klein Martin Kutrib |
author_facet | Rudolf Freund Andreas Klein Martin Kutrib |
author_sort | Rudolf Freund |
collection | DOAJ |
description | 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. |
first_indexed | 2024-12-12T05:33:41Z |
format | Article |
id | doaj.art-cb5c0e5f1284470bb25a5d09cfd4b11a |
institution | Directory Open Access Journal |
issn | 2075-2180 |
language | English |
last_indexed | 2024-12-12T05:33:41Z |
publishDate | 2009-07-01 |
publisher | Open Publishing Association |
record_format | Article |
series | Electronic Proceedings in Theoretical Computer Science |
spelling | doaj.art-cb5c0e5f1284470bb25a5d09cfd4b11a2022-12-22T00:36:14ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802009-07-013Proc. DCFS 200910110910.4204/EPTCS.3.9On the Number of Membranes in Unary P SystemsRudolf FreundAndreas KleinMartin KutribWe 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.http://arxiv.org/pdf/0907.5120v1 |
spellingShingle | Rudolf Freund Andreas Klein Martin Kutrib On the Number of Membranes in Unary P Systems Electronic Proceedings in Theoretical Computer Science |
title | On the Number of Membranes in Unary P Systems |
title_full | On the Number of Membranes in Unary P Systems |
title_fullStr | On the Number of Membranes in Unary P Systems |
title_full_unstemmed | On the Number of Membranes in Unary P Systems |
title_short | On the Number of Membranes in Unary P Systems |
title_sort | on the number of membranes in unary p systems |
url | http://arxiv.org/pdf/0907.5120v1 |
work_keys_str_mv | AT rudolffreund onthenumberofmembranesinunarypsystems AT andreasklein onthenumberofmembranesinunarypsystems AT martinkutrib onthenumberofmembranesinunarypsystems |