Equivalence of topological Markov shifts
From MaRDI portal
Publication:1239939
DOI10.1007/BF02761605zbMath0362.54034MaRDI QIDQ1239939
L. Wayne Goodwyn, Benjamin Weiss, Roy. L. Adler
Publication date: 1977
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items
Some properties of Ising automata, A vector space approach to the road coloring problem, The Synchronization Problem for Locally Strongly Transitive Automata, Unnamed Item, Bi-resolving graph homomorphisms and extensions of bi-closing codes, Primitive digraphs with large exponents and slowly synchronizing automata, Approximating the minimum length of synchronizing words is hard, On the Number of Synchronizing Colorings of Digraphs, An algorithm for road coloring, Factors and extensions of full shifts, Complexity of road coloring with prescribed reset words, Synchronizing finite automata on Eulerian digraphs., The road problem and homomorphisms of directed graphs, New characterizations of primitive permutation groups with applications to synchronizing automata, The NP-completeness of the road coloring problem, The road-colouring problem, Automorphisms of the Bernoulli endomorphism and a class of skew-products, In memoriam: Roy Adler (1931--2016) and the lasting impact of his work, A quadratic algorithm for road coloring, On the Road Coloring Problem, On incomplete and synchronizing finite sets, A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM, Cycles of relatively prime length and the road coloring problem, A note on the rank of semigroups., Ergodic and Bernoulli properties of analytic maps of complex projective space, Boundaries of Markov Partitions, The road coloring problem, Random walk in a finite directed graph subject to a road coloring, Realization of an Ergodic Markov Chain as a Random Walk Subject to a Synchronizing Road Coloring, Completely Reachable Automata, Černý's conjecture and the road colouring problem, Unnamed Item, A complete solution to the complexity of synchronizing road coloring for non-binary alphabets
Cites Work
