Finitely generated sofic systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3978417 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- Codes and local constraints
- Codes circulaires, automates locaux et entropie
- Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems)
- Sofic systems and encoding data
- Subshifts of finite type and sofic systems
- Systèmes codés. (Coded systems)
Cited in
(16)- Notes on Renewal Systems
- On sofic systems. II
- Symbolic Dynamics, Flower Automata and Infinite Traces
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
- Computability of topological pressure on compact shift spaces beyond finite type*
- Pseudo-cyclic renewal systems
- The entropies and periods of renewal systems
- Cyclic renewal systems
- A note on renewal systems
- Completing circular codes in regular submonoids
- A sofic system which is not spectrally of finite type
- Completing prefix codes in submonoids.
- A Sofic System with Infinitely Many Minimal Covers
- Finitely generated bi\(\omega\)-languages
- Computation theoretic aspects of cellular automata
This page was built for publication: Finitely generated sofic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263995)
