首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Finiteness and recognizability problems for substitution maps on two symbols
Authors:M J Crabb  J Duncan  C M McGregor
Institution:1. Department of Mathematics, University of Glasgow, Glasgow, G12 8QW, Scotland, UK
2. Department of Mathematical Sciences, SCEN 301, University of Arkansas, Fayetteville, AR 72701, USA
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.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号