On the public citation graph
Surjective Extensions of Sliding-Block Codes
0 signed · 33 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/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/bf01762187openalex-snapshot
Endomorphisms of irreducible subshifts of finite type
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(90)90046-kopenalex-snapshot
Codes and local constraints
inferredcites →https://doi.org/10.1016/s0195-6698(13)80036-4openalex-snapshot
On Completion of Codes with Finite Deciphering Delay
inferredcites →https://doi.org/10.1017/s0143385700001516openalex-snapshot
On the subsystems of topological Markov chains
inferredcites →https://doi.org/10.1017/s0143385700002133openalex-snapshot
Lower entropy factors of sofic systems
inferredcites →https://doi.org/10.1017/s0143385700006039openalex-snapshot
Eventual factor maps and compositions of closing maps
inferredcites →https://doi.org/10.1051/ita/1986200100891openalex-snapshot
Each regular code is included in a maximal regular code
inferredcites →https://doi.org/10.1090/s0002-9939-1985-0806078-7openalex-snapshot
A Note on Minimal Covers for Sofic Systems
inferredcites →https://doi.org/10.1090/s0002-9947-1993-1105064-9openalex-snapshot
An Extension Theorem for Closing Maps of Shifts of Finite Type
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
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/3-540-61440-0_115openalex-snapshot
Variable-length maximal codes
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_167openalex-snapshot
A completion algorithm for codes with bounded synchronization delay
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_10openalex-snapshot
Symbolic Dynamics and Finite Automata
inferred← citeshttps://doi.org/10.1007/bfb0023821openalex-snapshot
Automata and codes with bounded deciphering delay
inferred← citeshttps://doi.org/10.1007/s10440-013-9815-6openalex-snapshot
Bi-resolving Graph Homomorphisms and Extensions of Bi-closing codes
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00223-5openalex-snapshot
An application of Hajós factorizations to variable-length codes
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.033openalex-snapshot
Codes and sofic constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.043openalex-snapshot
Codes, unambiguous automata and sofic systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.023openalex-snapshot
Completing codes in a sofic shift
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115631openalex-snapshot
Completing Wheeler Automata
inferred← citeshttps://doi.org/10.1016/s0019-3577(07)80058-9openalex-snapshot
Weak equivalence for shifts of finite type
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00028-0openalex-snapshot
On maximal codes with bounded synchronization delay
inferred← citeshttps://doi.org/10.1017/9781108976039openalex-snapshot
Dimension Groups and Dynamical Systems
inferred← citeshttps://doi.org/10.1090/s0894-0347-1993-1168959-xopenalex-snapshot
Matrices of Polynomials, Positivity, and Finite Equivalence of Markov Chains
inferred← citeshttps://doi.org/10.1109/isit.2008.4595411openalex-snapshot
Embeddings of local automata
inferred← citeshttps://doi.org/10.1137/s0895480193244310openalex-snapshot
Canonical Encoders for Sliding Block Decoders
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.