Abstract
A shift space (or its set of factors) is eventually dendric if the possible extensions of all long enough factors are described by a graph which is a tree. We prove two results on eventually dendric shifts. First, all sets of return words to long enough words have the same cardinality. Next, this class of shifts is closed under complete bifix decoding.
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.
