Abstract
AbstractOne-sided sofic-Dyck shifts are sets of infinite sequences of symbols avoiding a visibly pushdown language of finite words. One-sided finite-type-Dyck shifts constitute a subclass of these sets of sequences. A (one-sided) finite-type-Dyck shift is defined as the set of infinite sequences avoiding both some finite set of words and some finite set of matching patterns. We prove that proper conjugacy is decidable for a large class of one-sided finite-type-Dyck shifts, the matched-return extensible shifts. This class contains many known non-sofic one-sided shifts like Dyck shifts and Motzkin shifts. It contains also strictly all extensible one-sided shifts of finite type. Our result is thus an extension of the decidability of conjugacy between one-sided shifts of finite type obtained by Williams.KeywordsTopological EntropyRegular LanguageMatched EdgeDyck PathShift TransformationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
