dc.contributor.author |
Titchener, M.R |
en |
dc.contributor.author |
Gulliver, A |
en |
dc.contributor.author |
Nicolescu, Radu |
en |
dc.contributor.author |
Speidel, U |
en |
dc.contributor.author |
Staiger, L |
en |
dc.date.accessioned |
2009-04-16T23:18:23Z |
en |
dc.date.available |
2009-04-16T23:18:23Z |
en |
dc.date.issued |
2004-12 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-255 (2004) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3762 |
en |
dc.description.abstract |
Lempel and Ziv (1976) proposed a computable string production-complexity. In this paper, our emphasis is on providing the rigorous development, where possible, for the theoretical aspects of a more recent and contrasting measure of string complexity. We derive expressions for complexity bounds subject to certain constraints. We derive and analytic approximation to the upper bound to linearize the complexity measure. The linearized measure enables us to propose an entropy measure, observed elsewhere to correspond closely with the Kolmogorov-Sinai entropy in simple dynamical systems. |
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 |
Deterministic Complexity and Entropy |
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 |