Multiplicities of covers for sofic shifts
From MaRDI portal
Publication:5958128
DOI10.1016/S0304-3975(00)00278-4zbMath0983.68143OpenAlexW1965872895MaRDI QIDQ5958128
Ulf-Rainer Fiebig, Nataša Jonoska, Doris Fiebig
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00278-4
Related Items (6)
TWO-DIMENSIONAL LANGUAGES AND CELLULAR AUTOMATA ⋮ On the structure of a sofic shift space ⋮ Reducibility of covers of AFT shifts ⋮ Determining presentations of sofic shifts ⋮ Optimal state amalgamation is NP-hard ⋮ A hierarchy of shift equivalent sofic shifts
Cites Work
- Sofic shifts with synchronizing presentations
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Lifting covers of sofic shifts
- A Sofic System with Infinitely Many Minimal Covers
- A Note on Minimal Covers for Sofic Systems
- Covers of Non-Almost-Finite Type Sofic Systems
- Factoring Factor Maps
- An Introduction to Symbolic Dynamics and Coding
This page was built for publication: Multiplicities of covers for sofic shifts