On the public citation graph
Decidability of shift equivalence
0 signed · 77 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-662-41922-9openalex-snapshot
Introduction to Quadratic Forms
inferredcites →https://doi.org/10.1007/bfb0061747openalex-snapshot
Classification of subshifts of finite type
inferredcites →https://doi.org/10.1007/bfb0082835openalex-snapshot
Topological conjugacy for 1-block factor maps of subshifts and sofic covers
inferredcites →https://doi.org/10.1017/s0143385700003308openalex-snapshot
On strong shift equivalence over a Boolean semiring
inferredcites →https://doi.org/10.1017/s0143385700003448openalex-snapshot
Topological conjugacy for sofic systems
inferredcites →https://doi.org/10.1070/sm1981v039n04abeh001631openalex-snapshot
GALOIS COHOMOLOGY AND SOME QUESTIONS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1090/s0002-9904-1971-12731-3openalex-snapshot
Classification of symbol spaces of finite type
inferredcites →https://doi.org/10.1109/tit.1983.1056597openalex-snapshot
Algorithms for sliding block codes - An application of symbolic dynamics to information theory
inferredcites →https://doi.org/10.1112/plms/s3-35.3.483openalex-snapshot
Block Coding and a Zeta Function for Finite Markov Chains
inferredcites →https://doi.org/10.2307/1970438openalex-snapshot
Solving Diophantine Problems Modulo Every Prime
inferredcites →https://doi.org/10.2307/1970908openalex-snapshot
Classification of Subshifts of Finite Type
inferredcites →https://doi.org/10.2307/1971091openalex-snapshot
Some General Algorithms. I: Arithmetic Groups
inferredcites →https://doi.org/10.2307/2274327openalex-snapshot
Decision problems concerning S-arithmetic groups
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_116openalex-snapshot
Symbolic dynamics and finite automata
inferred← citeshttps://doi.org/10.1007/978-1-4613-8354-3_1openalex-snapshot
Symbolic Dynamics and Matrices
inferred← citeshttps://doi.org/10.1007/978-3-0348-0502-5_4openalex-snapshot
Operator Algebras and C*-correspondences: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_10openalex-snapshot
Symbolic Dynamics and Finite Automata
inferred← citeshttps://doi.org/10.1007/s10440-013-9805-8openalex-snapshot
The Publications of Ki Hang Kim
inferred← citeshttps://doi.org/10.1007/s10440-013-9806-7openalex-snapshot
The Work of Kim and Roush in Symbolic Dynamics
inferred← citeshttps://doi.org/10.1016/0021-8693(89)90145-2openalex-snapshot
Problems equivalent to rational Diophantine solvability
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90294-7openalex-snapshot
Path components of matrices and strong shift equivalence over Q+
inferred← citeshttps://doi.org/10.1016/j.jfa.2013.09.018openalex-snapshot
C⁎ -algebras and equivalences for C⁎ -correspondences
inferred← citeshttps://doi.org/10.1016/j.jnt.2011.08.003openalex-snapshot
On some new invariants for shift equivalence for shifts of finite type
inferred← citeshttps://doi.org/10.1017/9781009465939.005openalex-snapshot
Symbolic dynamics and the stable algebra of matrices
inferred← citeshttps://doi.org/10.1017/9781108899727openalex-snapshot
An Introduction to Symbolic Dynamics and Coding
inferred← citeshttps://doi.org/10.1017/9781108899727.001openalex-snapshot
Preface to the First Edition
inferred← citeshttps://doi.org/10.1017/9781108899727.002openalex-snapshot
Preface to the Second Edition
inferred← citeshttps://doi.org/10.1017/9781108899727.008openalex-snapshot
Shifts as Dynamical Systems
inferred← citeshttps://doi.org/10.1017/9781108899727.010openalex-snapshot
Finite-to-One Codes and Finite Equivalence
inferred← citeshttps://doi.org/10.1017/9781108899727.011openalex-snapshot
Degrees of Codes and Almost Conjugacy
inferred← citeshttps://doi.org/10.1017/9781108899727.012openalex-snapshot
Embeddings and Factor Codes
inferred← citeshttps://doi.org/10.1017/9781108976039openalex-snapshot
Dimension Groups and Dynamical Systems
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.007openalex-snapshot
SHIFTS AS DYNAMICAL SYSTEMS
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.009openalex-snapshot
FINITE-TO-ONE CODES AND FINITE EQUIVALENCE
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.010openalex-snapshot
DEGREES OF CODES AND ALMOST CONJUGACY
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.011openalex-snapshot
EMBEDDINGS AND FACTOR CODES
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.014openalex-snapshot
GUIDE TO ADVANCED TOPICS
inferred← citeshttps://doi.org/10.1017/etds.2017.105openalex-snapshot
Optimal state amalgamation is NP-hard
inferred← citeshttps://doi.org/10.1017/etds.2020.126openalex-snapshot
Balanced strong shift equivalence, balanced in-splits, and eventual conjugacy
inferred← citeshttps://doi.org/10.1017/s0143385700000912openalex-snapshot
Non-stationarity of isomorphism between AF algebras defined by stationary Bratteli diagrams
inferred← citeshttps://doi.org/10.1017/s014338570100178xopenalex-snapshot
Decidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups
inferred← citeshttps://doi.org/10.1090/conm/798/15980openalex-snapshot
Invertible and noninvertible symbolic dynamics and their C*-algebras
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0962801-5openalex-snapshot
Undecidability of Module Homomorphisms
inferred← citeshttps://doi.org/10.1090/s0002-9939-1991-1065950-9openalex-snapshot
Solution of Two Conjectures in Symbolic Dynamics
inferred← citeshttps://doi.org/10.1090/s0002-9939-2015-12491-4openalex-snapshot
Bowen’s entropy-conjugacy conjecture is true up to finite index
inferred← citeshttps://doi.org/10.1090/s0002-9947-2012-05637-6openalex-snapshot
Class degree and relative maximal entropy
inferred← citeshttps://doi.org/10.1090/s0273-0979-99-00798-3openalex-snapshot
Strong shift equivalence theory and the shift equivalence problem
inferred← citeshttps://doi.org/10.1093/imrn/rnab204openalex-snapshot
The Stabilized Automorphism Group of a Subshift
inferred← citeshttps://doi.org/10.1112/blms/23.1.1openalex-snapshot
Notes on Coding Problems for Finite State Processes
inferred← citeshttps://doi.org/10.2140/apde.2024.17.345openalex-snapshot
Shift equivalences through the lens of Cuntz–Krieger algebras
inferred← citeshttps://doi.org/10.2307/120975openalex-snapshot
The Williams Conjecture is False for Irreducible Subshifts
inferred← citeshttps://doi.org/10.48550/arxiv.0809.2713openalex-snapshot
On some new invariants for strong shift equivalence for shifts of finite type
inferred← citeshttps://doi.org/10.48550/arxiv.1108.4994openalex-snapshot
Shift equivalence and a category equivalence involving graded modules over path algebras of quivers
inferred← citeshttps://doi.org/10.48550/arxiv.1210.6066openalex-snapshot
C*-algebras and Equivalences for C*-correspondences
inferred← citeshttps://doi.org/10.48550/arxiv.1310.2740openalex-snapshot
Bowen's entropy-conjugacy conjecture is true up to finite index
inferred← citeshttps://doi.org/10.48550/arxiv.math/9907095openalex-snapshot
The Williams Conjecture is false for irreducible subshifts
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.