On the public citation graph

The common algebraic structure of exit-automata and machines

https://doi.org/10.1007/bf02238820
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.1016/s0019-9958(67)90670-5openalex-snapshot
Automata in general algebras
inferredcites →https://doi.org/10.1073/pnas.50.5.869openalex-snapshot
FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
inferredcites →https://doi.org/10.1145/321203.321204openalex-snapshot
On Ianov's Program Schemata
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.2307/2004142openalex-snapshot
An Introduction to Mathematical Machine Theory

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-06953-4_1openalex-snapshot
Simple program schemes and formal languages
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_169openalex-snapshot
Some fundamentals of order-algebraic semantics
inferred← citeshttps://doi.org/10.1016/0021-8693(76)90106-xopenalex-snapshot
Matricial theories
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90034-xopenalex-snapshot
Calvin C. Elgot 1922–1980
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90050-8openalex-snapshot
Deterministic and nondeterministic flowchart interpretations
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90026-8openalex-snapshot
In memoriam Calvin C. Elgot
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90078-0openalex-snapshot
On rational definitions in complete algebras without rank
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.018openalex-snapshot
Fixing Zeno gaps
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)90766-9openalex-snapshot
Unique-entry graphs, flowcharts, and state diagrams
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80002-5openalex-snapshot
Systematic approach to reduction and minimization in automata and system theory
inferred← citeshttps://doi.org/10.1109/sfcs.1976.24openalex-snapshot
Rational algebraic theories and fixed-point solutions
inferred← citeshttps://doi.org/10.1109/swat.1970.19openalex-snapshot
Program schemata as automata
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.