Subword Metrics for Infinite Words

Hoffmann, S; Staiger, L

dc.contributor.author	Hoffmann, S	en
dc.contributor.author	Staiger, L	en
dc.date.accessioned	2016-01-04T21:55:58Z	en
dc.date.available	2016-01-04T21:55:58Z	en
dc.date.issued	2015	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-484 (2015)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/27853	en
dc.description.abstract	The space of one-sided infinite words plays a crucial rôle in several parts of Theoretical Computer Science. Usually, it is convenient to regard this space as a metric space, the Cantor-space. It turned out that for several purposes topologies other than the one of the Cantor-space are useful, e.g. for studying fragments of first-order logic over infinite words or for a topological characterisation of random infinite words. Continuing the work of [SS10], here we consider two different refinements of the Cantor-space, given by measuring common factors, and common factors occurring infinitely often. In particular we investigate the relation of these topologies to the sets of infinite words definable by finite automata, that is, to regular !-languages.	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	Subword Metrics for Infinite Words	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