On extensions of subshifts by finite groups

λ-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.