On the public citation graph

Some results on the relation between automata and their automorphism groups

https://doi.org/10.1007/bf02345486
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.1090/surv/007.1/01openalex-snapshot
Elementary concepts
inferredcites →https://doi.org/10.1145/321138.321144openalex-snapshot
Isomorphism Groups of Automata
inferredcites →https://doi.org/10.1145/321186.321194openalex-snapshot
On the Structures of an Automaton and Its Input Semigroup
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/bf00531757openalex-snapshot
Zur Theorie abstrakter stochastischer Automaten
inferred← citeshttps://doi.org/10.1007/bf01951360openalex-snapshot
On a group-matrix type automaton with output
inferred← citeshttps://doi.org/10.1007/bf02234044openalex-snapshot
A generalized concept of automaton automorphisms
inferred← citeshttps://doi.org/10.1007/bf02235400openalex-snapshot
Some remarks on a paper of G. Feichtinger
inferred← citeshttps://doi.org/10.1007/bf02238101openalex-snapshot
Der Quotientenautomat nach einem direkten Faktor einer Automorphismengruppe
inferred← citeshttps://doi.org/10.1007/bf02242371openalex-snapshot
On the number of automorphisms of non-cyclic automata
inferred← citeshttps://doi.org/10.1007/bf02927742openalex-snapshot
Stochastische Automaten als Grundlage linearer Lernmodelle
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90037-5openalex-snapshot
Endomorphisms of linear automata
inferred← citeshttps://doi.org/10.1016/0022-0000(79)90010-2openalex-snapshot
Automorphisms of linear automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.018openalex-snapshot
On structure and representations of cyclic automata
inferred← citeshttps://doi.org/10.1109/t-c.1971.223210openalex-snapshot
Periodic Representations and T-Partitionable Equivalents of 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.