On the public citation graph

A medvedev characterization of sets recognized by generalized finite automata

https://doi.org/10.1007/bf01706094
0 signed · 13 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.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.2307/2004143openalex-snapshot
Sequential Machines: Selected Papers

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1997.1452openalex-snapshot
On the Equivalence of Recursive and Nonrecursive Datalog Programs
inferred← citeshttps://doi.org/10.1007/3-540-07410-4_648openalex-snapshot
Allgemeine Σ-Grammatiken
inferred← citeshttps://doi.org/10.1007/3-540-36285-1_22openalex-snapshot
Decidable Containment of Recursive Queries
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_116openalex-snapshot
Nontraditional applications of automata theory
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_15openalex-snapshot
A Medvedev Characterization of Recognizable Tree Series
inferred← citeshttps://doi.org/10.1007/978-3-322-92151-2_7openalex-snapshot
Weitere Charakterisierungen akzeptabler Mengen
inferred← citeshttps://doi.org/10.1007/bf01246366openalex-snapshot
Classes of formal grammars
inferred← citeshttps://doi.org/10.1016/b978-0-12-708240-0.50011-3openalex-snapshot
Automata Theory for Database Theoreticians*†*Theoretician: 1. One who theorizes. 2. One who bases practice on theory. (From Webster's 3rd Int'l Dictionary, 1961.)†An earlier and shorter version of this paper appeared in Proc. 8th ACM Symp. on Principles of Database Systems, 1989, pp. 83–92
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.031openalex-snapshot
Decidable containment of recursive queries
inferred← citeshttps://doi.org/10.48550/arxiv.1510.02036openalex-snapshot
Tree Automata and Tree Grammars
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.