Determining presentations of sofic shifts

DOI10.1016/S0304-3975(99)00336-9zbMath0973.68121OpenAlexW2087634403MaRDI QIDQ5941276

Paul B. Trow

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00336-9

zbMATH Keywords

sofic shiftfinite labelled directed graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On the structure of a sofic shift space ⋮ Reducibility of covers of AFT shifts ⋮ Optimal state amalgamation is NP-hard

Cites Work

• Sofic systems and graphs
• Sofic shifts with synchronizing presentations
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• Lifting covers of sofic shifts
• Eventual factor maps and compositions of closing maps
• A Note on Minimal Covers for Sofic Systems
• Resolving maps and the dimension group for shifts of finite type
• Covers of Non-Almost-Finite Type Sofic Systems
• Minimal presentations for irreducible sofic shifts
• An Introduction to Symbolic Dynamics and Coding
• Multiplicities of covers for sofic shifts

This page was built for publication: Determining presentations of sofic shifts