The following pages link to Finitely generated sofic systems (Q1263995):
Displaying 16 items.
- Pseudo-cyclic renewal systems (Q719279) (← links)
- The entropies and periods of renewal systems (Q731352) (← links)
- Computation theoretic aspects of cellular automata (Q807035) (← links)
- Cyclic renewal systems (Q1029338) (← links)
- On sofic systems. II (Q1099433) (← links)
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180) (← links)
- Finitely generated bi\(\omega\)-languages (Q1183567) (← links)
- A note on renewal systems (Q1190482) (← links)
- Completing circular codes in regular submonoids (Q2474228) (← links)
- Completing prefix codes in submonoids. (Q2490823) (← links)
- Symbolic Dynamics, Flower Automata and Infinite Traces (Q3073631) (← links)
- Notes on Renewal Systems (Q3482543) (← links)
- A Sofic System with Infinitely Many Minimal Covers (Q3739877) (← links)
- A sofic system which is not spectrally of finite type (Q3787124) (← links)
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS (Q4464961) (← links)
- Computability of topological pressure on compact shift spaces beyond finite type* (Q5089481) (← links)