On the public citation graph
Finite procedures for sofic systems
0 signed · 62 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-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/bf01295322openalex-snapshot
Subshifts of finite type and sofic systems
inferredcites →https://doi.org/10.1007/bf01691062openalex-snapshot
Endomorphisms and automorphisms of the shift dynamical system
inferredcites →https://doi.org/10.1007/bf02230720openalex-snapshot
Unzerlegbare, nicht negative Matrizen
inferredcites →https://doi.org/10.1090/s0002-9947-1964-0161372-1openalex-snapshot
Intrinsic Markov Chains
inferredcites →https://doi.org/10.1112/blms/3.2.215openalex-snapshot
Axiom A Diffeomorphisms have Rational Zeta Functions
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
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-10704-5_14openalex-snapshot
Homomorphisms of graphs and their global maps
inferred← citeshttps://doi.org/10.1007/bf01217347openalex-snapshot
Computation theory of cellular automata
inferred← citeshttps://doi.org/10.1007/bf02772861openalex-snapshot
Semi-groups and graphs for sofic systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.04.008openalex-snapshot
Computing degree and class degree
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.017openalex-snapshot
Computational complexity of problems for deterministic presentations of sofic shifts
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/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/s0143385700002042openalex-snapshot
Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
inferred← citeshttps://doi.org/10.1017/s0143385700002777openalex-snapshot
An invariant for bounded-to-one factor maps between transitive sofic subshifts
inferred← citeshttps://doi.org/10.1017/s0143385700003114openalex-snapshot
Almost topological classification of finite-to-one factor maps between shifts of finite type
inferred← citeshttps://doi.org/10.1017/s0143385700006039openalex-snapshot
Eventual factor maps and compositions of closing maps
inferred← citeshttps://doi.org/10.1017/s0143385708000692openalex-snapshot
Open maps between shift spaces
inferred← citeshttps://doi.org/10.1080/14689367.2015.1081156openalex-snapshot
Class-closing factor codes and constant-class-to-one factor codes from shifts of finite type
inferred← citeshttps://doi.org/10.1090/s0002-9947-04-03437-3openalex-snapshot
On the structure of a sofic shift space
inferred← citeshttps://doi.org/10.1109/tit.1983.1056597openalex-snapshot
Algorithms for sliding block codes - An application of symbolic dynamics to information theory
inferred← citeshttps://doi.org/10.1109/tit.1985.1057037openalex-snapshot
Sofic systems and encoding data
inferred← citeshttps://doi.org/10.14232/actasm-015-323-0openalex-snapshot
K-theory for the simple C*-algebra of the Fibonacci–Dyck shift
inferred← citeshttps://doi.org/10.3934/jmd.2020001openalex-snapshot
The degree of Bowen factors and injective codings of diffeomorphisms
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.