Refined Bounds on Kolmorgorov Complexity for ω-Languages

Mielke, J

dc.contributor.author	Mielke, J	en
dc.date.accessioned	2009-04-16T23:12:54Z	en
dc.date.available	2009-04-16T23:12:54Z	en
dc.date.issued	2008-09	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-335 (2008)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3842	en
dc.description.abstract	The paper investigates bounds on various notions of complexity for w–languages. We understand the complexity of an w–languages as the complexity of the most complex strings contained in it. There have been shown bounds on simple and prefix complexity using fractal Hausdorff dimension. Here these bounds are refined by using general Hausdorff measure originally introduced by Felix Hausdorff. Furthermore a lower bound for a priori complexity is shown.	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	Refined Bounds on Kolmorgorov Complexity for ω-Languages	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