On the public citation graph

Graph grammars and tree transducers

https://doi.org/10.1007/bfb0017471
0 signed · 63 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-18771-5_41openalex-snapshot
May we introduce to you: Hyperedge replacement
inferredcites →https://doi.org/10.1007/3-540-51498-8_15openalex-snapshot
Context-free NCE graph grammars
inferredcites →https://doi.org/10.1007/3-540-53904-2_106openalex-snapshot
The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
inferredcites →https://doi.org/10.1007/3-540-54458-5_86openalex-snapshot
On the decidability of integer subgraph problems on context-free graph languages
inferredcites →https://doi.org/10.1007/3-540-55251-0_16openalex-snapshot
Finite tree automata with cost functions
inferredcites →https://doi.org/10.1007/3-540-55719-9_70openalex-snapshot
A Greibach normal form for context-free graph grammars
inferredcites →https://doi.org/10.1007/3-540-57163-9_14openalex-snapshot
Context-free graph grammars: Separating vertex replacement from hyperedge replacement
inferredcites →https://doi.org/10.1007/3-540-57163-9_29openalex-snapshot
A maximum path length pumping lemma for edge-replacement languages
inferredcites →https://doi.org/10.1007/978-3-663-01443-0openalex-snapshot
Graph-Grammatiken
inferredcites →https://doi.org/10.1007/bf00288976openalex-snapshot
Metatheorems for decision problems on hyperedge replacement graph languages
inferredcites →https://doi.org/10.1007/bf01178511openalex-snapshot
Context-free graph languages of bounded degree are generated by apex graph grammars
inferredcites →https://doi.org/10.1007/bf01683280openalex-snapshot
Top-down tree transducers with regular look-ahead
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf01695769openalex-snapshot
Mappings and grammars on trees
inferredcites →https://doi.org/10.1007/bfb0013875openalex-snapshot
Hyperedge Replacement: Grammars and Languages
inferredcites →https://doi.org/10.1007/bfb0017373openalex-snapshot
A note on hyperedge replacement
inferredcites →https://doi.org/10.1007/bfb0017397openalex-snapshot
A characterization of context-free NCE graph languages by monadic second-order logic on trees
inferredcites →https://doi.org/10.1007/bfb0035847openalex-snapshot
On polynomial time graph grammars
inferredcites →https://doi.org/10.1016/0022-0000(93)90004-gopenalex-snapshot
Handle-rewriting hypergraph grammars
inferredcites →https://doi.org/10.1016/0166-218x(81)90013-5openalex-snapshot
Complement reducible graphs
inferredcites →https://doi.org/10.1016/0166-218x(93)90106-xopenalex-snapshot
On hyperedge replacement and BNLC graph 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/0304-3975(90)90106-ropenalex-snapshot
Decidable boundedness problems for sets of graphs generated by hyperedge-replacement
inferredcites →https://doi.org/10.1016/0304-3975(91)90174-zopenalex-snapshot
Nonterminal separation in graph grammars
inferredcites →https://doi.org/10.1016/0304-3975(91)90387-hopenalex-snapshot
The monadic second-order logic of graphs V: on closing the gap between definability and recognizability
inferredcites →https://doi.org/10.1016/0304-3975(92)90148-9openalex-snapshot
The monadic second-order logic of graphs VII: graphs as relational structures
inferredcites →https://doi.org/10.1016/0304-3975(93)90064-zopenalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferredcites →https://doi.org/10.1016/0304-3975(93)90354-vopenalex-snapshot
A comparison of compatible, finite, and inductive graph properties
inferredcites →https://doi.org/10.1016/0304-3975(94)90271-2openalex-snapshot
Finite tree automata with cost functions
inferredcites →https://doi.org/10.1016/0890-5401(90)90038-jopenalex-snapshot
A comparison of boundary graph grammars and context-free hypergraph 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-12-115350-2.50014-2openalex-snapshot
SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50010-xopenalex-snapshot
Graph Rewriting: An Algebraic and Logic Approach
inferredcites →https://doi.org/10.1016/s0019-9958(67)90353-1openalex-snapshot
Algebraic automata and context-free sets
inferredcites →https://doi.org/10.1016/s0022-0000(05)80022-4openalex-snapshot
Hypergraph languages of bounded degree
inferredcites →https://doi.org/10.1090/conm/147/01200openalex-snapshot
Graph grammars, monadic second-order logic and the theory of graph minors
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/151261.151268openalex-snapshot
Efficient decision procedures for graph properties on context-free graph languages

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.1998.2715openalex-snapshot
Decidability of the Finiteness of Ranges of Tree Transductions
inferred← citeshttps://doi.org/10.1006/jcss.1996.0048openalex-snapshot
Language Theoretic and Algorithmic Properties ofd-dimensional Collages and Patterns in a Grid
inferred← citeshttps://doi.org/10.1006/jcss.1996.0087openalex-snapshot
Regular Description of Context-free Graph Languages
inferred← citeshttps://doi.org/10.1007/3-540-29953-x_10openalex-snapshot
The Automata-Theoretic Approach
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_22openalex-snapshot
Learning a Regular Tree Language from a Teacher
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_88openalex-snapshot
The use of tree transducers to compute translations between graph algebras
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_99openalex-snapshot
Concatenation of graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_38openalex-snapshot
On the Expressiveness of Deterministic Transducers over Infinite Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_2openalex-snapshot
Tree Languages Generated by Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-75414-5_11openalex-snapshot
An Algebra for Tree-Based Music Generation
inferred← citeshttps://doi.org/10.1007/s00224-001-1015-5openalex-snapshot
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs
inferred← citeshttps://doi.org/10.1007/s00224-005-1233-3openalex-snapshot
Query Learning of Regular Tree Languages: How to Avoid Dead States
inferred← citeshttps://doi.org/10.1007/s002240000115openalex-snapshot
A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars
inferred← citeshttps://doi.org/10.1007/s002360050106openalex-snapshot
Context-free graph grammars and concatenation of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.012openalex-snapshot
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00168-7openalex-snapshot
Tree-based picture generation
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00012-9openalex-snapshot
The evaluation of first-order substitution is monadic second-order compatible
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00263-6openalex-snapshot
Nondeterministic operations on finite relational structures
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80184-7openalex-snapshot
Semirings and Tree-to-Graph-to-Tree Transductions
inferred← citeshttps://doi.org/10.1017/s096012950000092xopenalex-snapshot
Equivalent definitions of recognizability for sets of graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1017/s0960129501003565openalex-snapshot
Fusion in relational structures and the verification of monadic second-order properties
inferred← citeshttps://doi.org/10.1023/a:1009939414825openalex-snapshot
Cooperating Distributed Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1142/9789812384720_0002openalex-snapshot
HYPEREDGE REPLACEMENT GRAPH GRAMMARS
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.26.360openalex-snapshot
Towards the Tree Automata Workbench Marbles
inferred← citeshttps://doi.org/10.3233/fi-1996-263403openalex-snapshot
A LOWER BOUND ON THE GROWTH OF FUNCTIONS COMPUTED BY TREE TRANSDUCERS
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.