Abstract
ABSTRACTλ-Graph systems are labelled Bratteli diagrams with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of λ-graph systems and study extensions of subshifts by finite groups. We prove that two canonical symbolic matrix systems are G-strong shift equivalent if and only if their presented subshifts are G-conjugate.
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.
