On the public citation graph

Homomorphisms between stochastic sequential machines and related problems

https://doi.org/10.1007/bf01694007
0 signed · 15 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0019-9958(67)90465-2openalex-snapshot
Minimization theorems and techniques for sequential stochastic machines
inferredcites →https://doi.org/10.1109/pgec.1965.264008openalex-snapshot
Comments on the Minimization of Stochastic Machines
inferredcites →https://doi.org/10.1109/swat.1966.20openalex-snapshot
Reconsider the state minimization problem for stochastic finite state systems
inferredcites →https://doi.org/10.1109/tct.1964.1082297openalex-snapshot
Minimal-State Stochastic Finite State Systems
inferredcites →https://doi.org/10.4324/9780203137079-15openalex-snapshot
Information and control

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-7908-1838-3_5openalex-snapshot
Fuzzy Machines, Languages, and Grammars
inferred← citeshttps://doi.org/10.1007/bf01088986openalex-snapshot
Probabilistic automata
inferred← citeshttps://doi.org/10.1007/bf01683284openalex-snapshot
Deterministic representation of probabilistic systems by ergodic machines
inferred← citeshttps://doi.org/10.1016/0022-247x(72)90031-5openalex-snapshot
On reductions of maximin machines
inferred← citeshttps://doi.org/10.1016/b978-0-12-417750-5.50019-1openalex-snapshot
DISPERSION MATRICES AND STOCHASTIC AUTOMATA MORPHISMS
inferred← citeshttps://doi.org/10.1016/b978-0-12-547650-8.50014-0openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.laa.2026.04.032openalex-snapshot
Geometry of low nonnegative rank matrix completion
inferred← citeshttps://doi.org/10.1016/s0019-9958(72)90251-3openalex-snapshot
First and second covering problems of quasi stochastic systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)80036-7openalex-snapshot
The dimension of stability of stochastic automata
inferred← citeshttps://doi.org/10.1109/tc.1979.1675300openalex-snapshot
An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines
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.