Finitely generated sofic systems
From MaRDI portal
Publication:1263995
DOI10.1016/0304-3975(89)90049-2zbMath0688.68076MaRDI QIDQ1263995
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
68Q45: Formal languages and automata
Related Items
FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS, Pseudo-cyclic renewal systems, The entropies and periods of renewal systems, Computation theoretic aspects of cellular automata, Cyclic renewal systems, 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., Symbolic Dynamics, Flower Automata and Infinite Traces, Notes on Renewal Systems
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
