Deterministic Transistion P Systems Modeled as Register Machines

Dinneen, MJ; Kim, Y-B

dc.contributor.author	Dinneen, MJ	en
dc.contributor.author	Kim, Y-B	en
dc.date.accessioned	2015-01-05T00:14:05Z	en
dc.date.available	2015-01-05T00:14:05Z	en
dc.date.issued	2014	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-465 (2014)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/23897	en
dc.description.abstract	This paper presents the details for constructing register machines that simulate deterministic transition P systems with rule priorities. The time complexity of the constructed register machine is polynomial with respect to the number of rewriting rules applied. We illustrate our conversion with a non-trivial example.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php	en
dc.title	Deterministic Transistion P Systems Modeled as Register Machines	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en