Finiteness and recognizability problems for substitution maps on two symbols

Crabb, M. J., Duncan, J. and McGregor, C. M. (2010) Finiteness and recognizability problems for substitution maps on two symbols. Semigroup Forum, 81(1), pp. 71-84. (doi: 10.1007/s00233-010-9246-x)

Full text not currently available from Enlighten.

Publisher's URL: http://dx.doi.org/10.1007/s00233-010-9246-x

Abstract

We investigate minimal, compact, square-closed subsets of the unit circle by identifying them with subsets of [0,1] and with sets of infinite words on two symbols; in particular, such sets arising from substitution maps. We consider problems on finiteness, recognizability, square roots, density and measure. Properties of the free semigroup on two symbols play a significant role in the analysis.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:McGregor, Dr Colin and Crabb, Dr Michael
Authors: Crabb, M. J., Duncan, J., and McGregor, C. M.
College/School:College of Science and Engineering > School of Mathematics and Statistics > Mathematics
Journal Name:Semigroup Forum
ISSN:0037-1912

University Staff: Request a correction | Enlighten Editors: Update this record