Computational Complementarity for Mealy Automata

Calude, C.S; Calude, E; Stefanescu, C

dc.contributor.author	Calude, C.S	en
dc.contributor.author	Calude, E	en
dc.contributor.author	Stefanescu, C	en
dc.date.accessioned	2009-04-16T23:10:39Z	en
dc.date.available	2009-04-16T23:10:39Z	en
dc.date.issued	1998-05	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-083 (1998)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3592	en
dc.description.abstract	In this paper we extend (and study) two computational complementary principles from Moore to Mealy automata which are finite machines possessing better “quantum-like” features. We conjecture that automata which are reversible according to Svozil do not satisfy any of these computational complementarity principles. This result is consistent with the embeddability of irreversible computations into reversible ones (via Bennett’s method, for example). Mathematica experiments confirmed this hypothesis.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Computational Complementarity for Mealy Automata	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en