A conjugacy invariant for reducible sofic shifts and its semigroup characterizations

被引:0
作者
Nataša Jonoska
机构
[1] University of South Florida,Department of Mathematics
来源
Israel Journal of Mathematics | 1998年 / 106卷
关键词
Zeta Function; Irreducible Component; Finite Type; Topological Conjugacy; Full Shift;
D O I
暂无
中图分类号
学科分类号
摘要
We introduce a notion of magic words and, through them, we present a lattice of sub-synchronizing subshifts which describes the synchronizing parts of a sofic shiftS. We show that topological conjugacy maps subsynchronizing subshifts onto sub-synchronizing subshifts, it preserves their mutual relationship (i.e. the corresponding lattices are isomorphic) and the corresponding covers within the Krieger covers are topologically conjugate. Using the magic words, a full characterization of the syntactic monoid of a shift of finite type is given. We show that a synchronizing deterministic presentation of every sub-synchronizing subshift ofS can be seen within a two-sided ideal of the syntactic monoid ofS.
引用
收藏
页码:221 / 249
页数:28
相关论文
共 20 条
  • [1] Blanchard F.(1986)Système Codés Theoretical Computer Science 44 17-49
  • [2] Hansel G.(1985)A note on minimal covers for sofic systems Proceedings of the American Mathematical Society 95 403-411
  • [3] Boyle M.(1992), in Contemporary Mathematics 135 139-180
  • [4] Kitchens B.(1975)Sofic systems and graphs Monatshefte für Mathematik 80 179-186
  • [5] Marcus B.(1969)Endomorphisms and automorphisms of the shift dynamical system Mathematical Systems Theory 3 320-375
  • [6] Fiebig D.(1996)Sofic systems with synchronizing representations Theoretical Computer Science 158 81-115
  • [7] Fiebig U. R.(1996)Constants in factorial and prolongable languages Pure Mathematics and Applications 7 99-110
  • [8] Fischer R.(1994)Minimal presentations for irreducible sofic shifts IEEE Transactions on Information and Theory 40 1818-1825
  • [9] Hedlund G. A.(1984)On sofic systems I Israel Journal of Mathematics 48 305-330
  • [10] Jonoska N.(1980)A characterization of strictly locally testable languages and its applications to subsemigroups of a free semigroup Information and Control 44 300-319