On the public citation graph

Transductions of dags and trees

https://doi.org/10.1007/bf01786981
0 signed · 33 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/3-540-09526-8_29openalex-snapshot
Parallel and two-way recognizers of directed acyclic graphs
inferredcites →https://doi.org/10.1007/bf01683280openalex-snapshot
Top-down tree transducers with regular look-ahead
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.1007/bf01695769openalex-snapshot
Mappings and grammars on trees
inferredcites →https://doi.org/10.1007/bf01704019openalex-snapshot
Context-free preserving functions
inferredcites →https://doi.org/10.1007/bf01704020openalex-snapshot
Bottom-up and top-down tree transformations— a comparison
inferredcites →https://doi.org/10.1007/bf01762181openalex-snapshot
Semantic preserving translations
inferredcites →https://doi.org/10.1007/bf01786975openalex-snapshot
Three hierarchies of transducers
inferredcites →https://doi.org/10.1016/0022-0000(80)90058-6openalex-snapshot
Tree transducers, L systems, and two-way machines
inferredcites →https://doi.org/10.1016/s0019-9958(68)90374-4openalex-snapshot
Algebra automata I: Parallel programming as a prolegomena to the categorical approach
inferredcites →https://doi.org/10.1016/s0019-9958(71)90706-6openalex-snapshot
Translations on a context free grammar
inferredcites →https://doi.org/10.1016/s0019-9958(74)90810-9openalex-snapshot
Acceptors for the derivation languages of phrase-structure grammars
inferredcites →https://doi.org/10.1016/s0019-9958(75)90489-1openalex-snapshot
On the syntactic structures of unrestricted grammars I. Generative grammars and phrase structure grammars
inferredcites →https://doi.org/10.1016/s0019-9958(75)90495-7openalex-snapshot
On the syntactic structures of unrestricted grammars II. Automata
inferredcites →https://doi.org/10.1016/s0019-9958(79)90561-8openalex-snapshot
Composition of top-down and bottom-up tree transductions
inferredcites →https://doi.org/10.1016/s0022-0000(70)80017-4openalex-snapshot
Generalized2 sequential machine maps
inferredcites →https://doi.org/10.1137/0207030openalex-snapshot
Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
inferredcites →https://doi.org/10.1145/800125.804051openalex-snapshot
Tree transductions and families of tree languages
inferredcites →https://doi.org/10.1145/800161.805159openalex-snapshot
Transformations on straight line programs - (Preliminary Version)

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1995.1043openalex-snapshot
A Kleene Theorem for a Class of Planar Acyclic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24897-9_8openalex-snapshot
Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
inferred← citeshttps://doi.org/10.1007/bfb0017142openalex-snapshot
Automata and rational expressions on planar graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-046370-1.50009-7openalex-snapshot
On Recognizable Sets and Tree Automata
inferred← citeshttps://doi.org/10.1016/j.scico.2016.03.006openalex-snapshot
Generalising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.11.022openalex-snapshot
Graph automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00054-1openalex-snapshot
The ancestor width of grammars and languages
inferred← citeshttps://doi.org/10.1145/2678015.2682539openalex-snapshot
Generalising Tree Traversals to DAGs
inferred← citeshttps://doi.org/10.1145/3571230openalex-snapshot
A Robust Theory of Series Parallel Graphs
inferred← citeshttps://doi.org/10.18653/v1/p18-1179openalex-snapshot
Language Generation via DAG Transduction
inferred← citeshttps://doi.org/10.4204/eptcs.407.2openalex-snapshot
A New Notion of Regularity: Finite State Automata Accepting Graphs
inferred← citeshttps://doi.org/10.4230/dagrep.5.3.143openalex-snapshot
Formal Models of Graph Transformation in Natural Language Processing (Dagstuhl Seminar 15122)
inferred← citeshttps://doi.org/10.63317/44jchxktu3jiopenalex-snapshot
Mapping Between English Strings and Reentrant Semantic Graphs
inferred← citeshttps://doi.org/10.7916/d8jh3zrropenalex-snapshot
Grammar-Based Semantic Parsing Into Graph Representations
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.