On the public citation graph

Probabilistic automata and stochastic transformations

0 signed · 17 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.1214/aoms/1177700000openalex-snapshot
On Stochastic Processes Derived From Markov Chains

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-07142-3_70openalex-snapshot
Automata in additive categories with applications to stochastic linear automata
inferred← citeshttps://doi.org/10.1007/978-3-030-66952-2_7openalex-snapshot
Stochastic Realization
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9openalex-snapshot
Language and Automata Theory and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_36openalex-snapshot
Hankel Matrices for Weighted Visibly Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-45509-4_21openalex-snapshot
On the Internal Structure of Finite-State Stochastic Processes
inferred← citeshttps://doi.org/10.1007/bf01088986openalex-snapshot
Probabilistic automata
inferred← citeshttps://doi.org/10.1007/bf01768487openalex-snapshot
Representation of a word function as the sum of two functions
inferred← citeshttps://doi.org/10.1007/bf01824805openalex-snapshot
The mixing properties of certain processes related to Markov chains
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90181-3openalex-snapshot
Stochastic automata with large state spaces and low rank
inferred← citeshttps://doi.org/10.1016/0025-5564(70)90048-9openalex-snapshot
Linked probabilistic finite automata: A model for the temporal interaction of speakers
inferred← citeshttps://doi.org/10.1016/b978-0-12-547650-8.50014-0openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90073-6openalex-snapshot
Un codage non commutatif pour certains systmes chantillonns non linaires
inferred← citeshttps://doi.org/10.1017/cbo9780511819407.002openalex-snapshot
Hidden Markov processes in the context of symbolic dynamics
inferred← citeshttps://doi.org/10.1109/tit.2007.899514openalex-snapshot
Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension
inferred← citeshttps://doi.org/10.1137/s0895479892235599openalex-snapshot
Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
inferred← citeshttps://doi.org/10.2139/ssrn.7489642openalex-snapshot
Functional Identity Beyond Weights:Predictive Geometry in AutoregressiveTransformers
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.