اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUnambiguously coded shifts
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the coded systems introduced by Blanchard and Hansel. We give several constructions which allow one to represent a coded system as a strongly unambiguous one.
قيم البحث
اقرأ أيضاً
We prove that the Karoubi envelope of a shift --- defined as the Karoubi envelope of the syntactic semigroup of the language of blocks of the shift --- is, up to natural equivalence of categories, an invariant of flow equivalence. More precisely, we
show that the action of the Karoubi envelope on the Krieger cover of the shift is a flow invariant. An analogous result concerning the Fischer cover of a synchronizing shift is also obtained. From these main results, several flow equivalence invariants --- some new and some old --- are obtained. We also show that the Karoubi envelope is, in a natural sense, the best possible syntactic invariant of flow equivalence of sofic shifts. Another application concerns the classification of Markov-Dyck and Markov-Motzkin shifts: it is shown that, under mild conditions, two graphs define flow equivalent shifts if and only if they are isomorphic. Shifts with property (A) and their associated semigroups, introduced by Wolfgang Krieger, are interpreted in terms of the Karoubi envelope, yielding a proof of the flow invariance of the associated semigroups in the cases usually considered (a result recently announced by Krieger), and also a proof that property (A) is decidable for sofic shifts.
Motivated by the study of Fibonacci-like Wang shifts, we define a numeration system for $mathbb{Z}$ and $mathbb{Z}^2$ based on the binary alphabet ${0,1}$. We introduce a set of 16 Wang tiles that admits a valid tiling of the plane described by a det
erministic finite automaton taking as input the representation of a position $(m,n)inmathbb{Z}^2$ and outputting a Wang tile.
We study rank-two symbolic systems (as topological dynamical systems) and prove that the Thue-Morse sequence and quadratic Sturmian sequences are rank-two and define rank-two symbolic systems.
We give a description of the link between topological dynamical systems and their dimension groups. The focus is on minimal systems and, in particular, on substitution shifts. We describe in detail the various classes of systems including Sturmian sh
ifts and interval exchange shifts. This is a preliminary version of a book which will be published by Cambridge University Press. Any comments are of course welcome.
We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT), we show th
at the CPC-irreducibility of TSFTs is related to the connectivity of its graph representation, which is a similar result to one-dimensional shifts of finite type.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
