Minimal presentations for irreducible sofic shifts

DOI10.1109/18.340457zbMATH Open0841.58020OpenAlexW2148408949MaRDI QIDQ4850282FDOQ4850282

Authors: Brian Marcus, Nataşa Jonoska 

Publication date: 2 July 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.340457

Recommendations

• Determining presentations of sofic shifts
• Sofic shifts with synchronizing presentations
• Semi-groups and graphs for sofic systems
• A hierarchy of shift equivalent sofic shifts
• A Note on Minimal Covers for Sofic Systems

zbMATH Keywords

sofic shiftsubshift of finite typeminimal presentationsabstract symbolic dynamicsKrieger covers

Mathematics Subject Classification ID

Low-dimensional dynamical systems (37E99)

Cited In (8)

• Sofic shifts with synchronizing presentations
• Path sets in one-sided symbolic dynamics
• Determining presentations of sofic shifts
• A conjugacy invariant for reducible sofic shifts and its semigroup characterizations
• Reducibility of covers of AFT shifts
• Optimal state amalgamation is NP-hard
• Sofic tree-shifts
• Computational complexity of \(k\)-block conjugacy

This page was built for publication: Minimal presentations for irreducible sofic shifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850282)