On the public citation graph
The definability of equational graphs in monadic second-order logic
0 signed · 28 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/3-540-18771-5_49openalex-snapshot
A representation of graphs by algebraic expressions and its use for graph rewriting systems
inferredcites →https://doi.org/10.1007/3-540-50728-0_34openalex-snapshot
The monadic second-order logic of graphs : Definable sets of finite graphs
inferredcites →https://doi.org/10.1007/3-540-50728-0_35openalex-snapshot
On systems of equations defining infinite graphs
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf01744577openalex-snapshot
An axiomatic approach to the Korenjak-Hopcroft algorithms
inferredcites →https://doi.org/10.1007/bf02088013openalex-snapshot
The monadic second-order logic of graphs, II: Infinite graphs of bounded width
inferredcites →https://doi.org/10.1016/0022-0000(79)90026-6openalex-snapshot
Least fixed point of a functor
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50014-7openalex-snapshot
Recursive Applicative Program Schemes
inferredcites →https://doi.org/10.1016/s0049-237x(08)71929-3openalex-snapshot
Weakly Definable Relations and Special Automata
inferredcites →https://doi.org/10.1090/cbms/013openalex-snapshot
Automata on Infinite Objects and Church’s Problem
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
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-52590-4_42openalex-snapshot
On the regular structure of prefix rewriting
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_51openalex-snapshot
On the transition graphs of automata and grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_31openalex-snapshot
The Isomorphism Problem for ω-Automatic Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_16openalex-snapshot
Isomorphism of Regular Trees and Words
inferred← citeshttps://doi.org/10.1007/bfb0017390openalex-snapshot
An application of graph grammars to the elimination of redundancy from functions defined by schemes
inferred← citeshttps://doi.org/10.1007/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90278-nopenalex-snapshot
On the regular structure of prefix rewriting
inferred← citeshttps://doi.org/10.1016/j.apal.2012.09.001openalex-snapshot
The isomorphism problem for ω-automatic trees
inferred← citeshttps://doi.org/10.1016/j.ic.2013.01.002openalex-snapshot
Isomorphism of regular trees and words
inferred← citeshttps://doi.org/10.1017/cbo9780511974960.002openalex-snapshot
Automata-based presentations of infinite structures
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.