Finitely generated sofic systems

DOI10.1016/0304-3975(89)90049-2zbMath0688.68076OpenAlexW2024574575MaRDI QIDQ1263995

Antonio Restivo

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90049-2

zbMATH Keywords

sofic systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (13)

Computability of topological pressure on compact shift spaces beyond finite type* ⋮ Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems ⋮ Finitely generated bi\(\omega\)-languages ⋮ A note on renewal systems ⋮ Completing circular codes in regular submonoids ⋮ Completing prefix codes in submonoids. ⋮ Pseudo-cyclic renewal systems ⋮ Notes on Renewal Systems ⋮ The entropies and periods of renewal systems ⋮ Symbolic Dynamics, Flower Automata and Infinite Traces ⋮ FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS ⋮ Cyclic renewal systems ⋮ Computation theoretic aspects of cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes and local constraints
• Systèmes codés. (Coded systems)
• Codes circulaires, automates locaux et entropie
• Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems)
• Subshifts of finite type and sofic systems
• Sofic systems and encoding data
• Algorithms for sliding block codes - An application of symbolic dynamics to information theory

This page was built for publication: Finitely generated sofic systems