Finite procedures for sofic systems
From MaRDI portal
Cites work
- Axiom A Diffeomorphisms have Rational Zeta Functions
- Endomorphisms and automorphisms of the shift dynamical system
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Intrinsic Markov Chains
- Sofic systems
- Sofic systems and graphs
- Subshifts of finite type and sofic systems
- Unzerlegbare, nicht negative Matrizen
Cited in
(12)- On sofic systems. I
- Computation theory of cellular automata
- Semi-groups and graphs for sofic systems
- The degree of Bowen factors and injective codings of diffeomorphisms
- Computational complexity of problems for deterministic presentations of sofic shifts
- Computing degree and class degree
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
- Open maps between shift spaces
- Class-closing factor codes and constant-class-to-one factor codes from shifts of finite type
- Eventual factor maps and compositions of closing maps
- An invariant for bounded-to-one factor maps between transitive sofic subshifts
- On the structure of a sofic shift space
This page was built for publication: Finite procedures for sofic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243015)