On acceptance conditions for membrane systems: characterisations of L and NL

On acceptance conditions for membrane systems: characterisations of L and NL

In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditions (one easier to program, the other easier to prove correctness) both characterise the same complexity class, NL. We als...

Full description

Bibliographic Details
Main Authors: Damien Woods, Niall Murphy
Format: Article
Language:English
Published: Open Publishing Association 2009-06-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/0906.3327v1
id doaj-25a7515fef844bc5b577ee1bff66283c
record_format Article
spelling doaj-25a7515fef844bc5b577ee1bff66283c2020-11-24T23:09:56ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802009-06-011Proc. CSP 200817218410.4204/EPTCS.1.17On acceptance conditions for membrane systems: characterisations of L and NLDamien WoodsNiall MurphyIn this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditions (one easier to program, the other easier to prove correctness) both characterise the same complexity class, NL. We also find that by restricting the acceptance conditions we obtain a characterisation of L. We obtain these results by investigating the connectivity properties of dependency graphs that model membrane system computations. http://arxiv.org/pdf/0906.3327v1
collection DOAJ
language English
format Article
sources DOAJ
author Damien Woods
Niall Murphy
spellingShingle Damien Woods
Niall Murphy
On acceptance conditions for membrane systems: characterisations of L and NL
Electronic Proceedings in Theoretical Computer Science
author_facet Damien Woods
Niall Murphy
author_sort Damien Woods
title On acceptance conditions for membrane systems: characterisations of L and NL
title_short On acceptance conditions for membrane systems: characterisations of L and NL
title_full On acceptance conditions for membrane systems: characterisations of L and NL
title_fullStr On acceptance conditions for membrane systems: characterisations of L and NL
title_full_unstemmed On acceptance conditions for membrane systems: characterisations of L and NL
title_sort on acceptance conditions for membrane systems: characterisations of l and nl
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2009-06-01
description In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditions (one easier to program, the other easier to prove correctness) both characterise the same complexity class, NL. We also find that by restricting the acceptance conditions we obtain a characterisation of L. We obtain these results by investigating the connectivity properties of dependency graphs that model membrane system computations.
url http://arxiv.org/pdf/0906.3327v1
work_keys_str_mv AT damienwoods onacceptanceconditionsformembranesystemscharacterisationsoflandnl
AT niallmurphy onacceptanceconditionsformembranesystemscharacterisationsoflandnl
_version_ 1725609076074741760

Similar Items