Deterministic Complexity and Entropy

Show simple item record Titchener, M.R en Gulliver, A en Nicolescu, Radu en Speidel, U en Staiger, L en 2009-04-16T23:18:23Z en 2009-04-16T23:18:23Z en 2004-12 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-255 (2004) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri 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 en
dc.source.uri 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 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace