Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
From MaRDI portal
Publication:3333063
DOI10.1017/S0143385700002042zbMath0544.05029MaRDI QIDQ3333063
Publication date: 1983
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items (20)
Class-closing factor codes and constant-class-to-one factor codes from shifts of finite type ⋮ Flow equivalence of sofic shifts ⋮ Permutation cellular automata ⋮ Bi-resolving graph homomorphisms and extensions of bi-closing codes ⋮ Homomorphisms, representations and characteristic polynomials of digraphs ⋮ Decompositions of factor maps involving bi-closing maps ⋮ Statistical mechanics of surjective cellular automata ⋮ An interconnection of local maps inducing onto global maps ⋮ The projective fundamental group of a ℤ2-shift ⋮ Sofic Constant-to-One Extensions of Subshifts of Finite Type ⋮ Nondegenerate 𝑞-biresolving textile systems and expansive automorphisms of onesided full shifts ⋮ Nondeterministic cellular automata ⋮ Decompositions of factor codes and embeddings between shift spaces with unequal entropies ⋮ A Note on Minimal Covers for Sofic Systems ⋮ Unnamed Item ⋮ On the existence of open and bi-continuing codes ⋮ Open maps between shift spaces ⋮ Degrees of Constant-to-One Factor Maps ⋮ Graph fibrations, graph isomorphism, and PageRank ⋮ The dynamics of expansive invertible onesided cellular automata
Cites Work
- Unnamed Item
- Factors and extensions of full shifts
- An interconnection of local maps inducing onto global maps
- Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs
- Sofic systems
- Finite procedures for sofic systems
- Classification of subshifts of finite type
- Indecomposable local maps of tessellation automata
- An Invariant for Continuous Factors of Markov Shifts
- Endomorphisms of irreducible subshifts of finite type
- A Finitary Classification of Topological Markov Chains and Sofic Systems
- Block Coding and a Zeta Function for Finite Markov Chains
- Local maps inducing surjective global maps of one-dimensional tessellation automata
- The Theory of Definite Automata
- Endomorphisms and automorphisms of the shift dynamical system
- Homomorphisms of symbolic dynamical systems
This page was built for publication: Constant-to-one and onto global maps of homomorphisms between strongly connected graphs