On the public citation graph
High level tree transducers and iterated pushdown tree transducers
0 signed · 76 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.1007/3-540-06867-8_14openalex-snapshot
Notes on pre-set pushdown automata
inferredcites →https://doi.org/10.1007/bf00289307openalex-snapshot
The formal power of one-visit attribute grammars
inferredcites →https://doi.org/10.1007/bf01683280openalex-snapshot
Top-down tree transducers with regular look-ahead
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/bf01704020openalex-snapshot
Bottom-up and top-down tree transformations— a comparison
inferredcites →https://doi.org/10.1007/bf01744285openalex-snapshot
An order-algebraic definition of knuthian semantics
inferredcites →https://doi.org/10.1007/bfb0015742openalex-snapshot
Characterization of high level tree 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/0304-3975(82)90003-2openalex-snapshot
Attribute grammars and recursive program schemes I
inferredcites →https://doi.org/10.1016/0304-3975(82)90009-3openalex-snapshot
The IO- and OI-hierarchies
inferredcites →https://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot
Attribute grammars and recursive program schemes II
inferredcites →https://doi.org/10.1016/0304-3975(86)90052-6openalex-snapshot
Pushdown machines for the macro tree transducer
inferredcites →https://doi.org/10.1016/0890-5401(88)90026-0openalex-snapshot
The OI-hierarchy is closed under control
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/s0019-9958(69)90065-5openalex-snapshot
Tree generating regular systems
inferredcites →https://doi.org/10.1016/s0019-9958(70)80039-0openalex-snapshot
Full AFLs and nested iterated substitution
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(86)80016-xopenalex-snapshot
An automata-theoretical characterization of the OI-hierarchy
inferredcites →https://doi.org/10.1016/s0022-0000(67)80014-xopenalex-snapshot
Some definitional suggestions for automata theory
inferredcites →https://doi.org/10.1016/s0022-0000(70)80017-4openalex-snapshot
Generalized2 sequential machine maps
inferredcites →https://doi.org/10.1016/s0022-0000(74)80031-0openalex-snapshot
A generalized approach to formal languages
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1145/800061.808767openalex-snapshot
Iterated pushdown automata and complexity classes
inferredcites →https://doi.org/10.1145/800161.805158openalex-snapshot
On syntax-directed transduction and tree transducers
inferredcites →https://doi.org/10.3990/1.6114822openalex-snapshot
Tree transducers and pushdown machines
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/inco.1999.2807openalex-snapshot
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations
inferred← citeshttps://doi.org/10.1006/jcss.1998.1573openalex-snapshot
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers
inferred← citeshttps://doi.org/10.1006/jcss.2001.1816openalex-snapshot
Output String Languages of Compositions of Deterministic Macro Tree Transducers
inferred← citeshttps://doi.org/10.1007/11737414_7openalex-snapshot
XML Type Checking Using High-Level Tree Transducer
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_3openalex-snapshot
The Delta Operation: From Strings to Trees to Strings
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_38openalex-snapshot
A hierarchy of deterministic top-down tree transformations
inferred← citeshttps://doi.org/10.1007/978-3-030-21363-3_12openalex-snapshot
Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-23021-4_11openalex-snapshot
A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_22openalex-snapshot
Verification of Tree-Processing Programs via Higher-Order Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_17openalex-snapshot
Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-642-72283-7_5openalex-snapshot
Treebag — Baum-basierte Generierung und Transformation von Objekten
inferred← citeshttps://doi.org/10.1007/bf01305313openalex-snapshot
A hierarchy of deterministic top-down tree transformations
inferred← citeshttps://doi.org/10.1007/s00224-008-9125-yopenalex-snapshot
Composing Stack-Attributed Tree Transducers
inferred← citeshttps://doi.org/10.1007/s00236-003-0120-0openalex-snapshot
A comparison of pebble tree transducers with macro tree transducers
inferred← citeshttps://doi.org/10.1007/s00236-019-00360-8openalex-snapshot
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
inferred← citeshttps://doi.org/10.1007/s10990-013-9093-zopenalex-snapshot
Functional programs as compressed data
inferred← citeshttps://doi.org/10.1016/0167-6423(91)90009-mopenalex-snapshot
Functional description of the contextual analysis in block-structured programming languages: a case study of tree transducers
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90353-4openalex-snapshot
Modular tree transducers
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90211-wopenalex-snapshot
Top-down tree transducers with two-way tree walking look-ahead
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00111-uopenalex-snapshot
Deterministic top-down tree transducers with iterated look-ahead
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90281-xopenalex-snapshot
Transducers and the decidability of independence in free monoids
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90054-lopenalex-snapshot
A complete rewriting system for a monoid of tree transformation classes
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90015-topenalex-snapshot
Iterated stack automata and complexity classes
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104447openalex-snapshot
Weighted automata with storage
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104657openalex-snapshot
Principal abstract families of weighted tree languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80050-9openalex-snapshot
The translation power of top-down tree-to-graph transducers
inferred← citeshttps://doi.org/10.1017/s0960129503004109openalex-snapshot
Syntactic composition of top-down tree transducers is short cut fusion
inferred← citeshttps://doi.org/10.1017/s0960129513000054openalex-snapshot
Verification of tree-processing programs via higher-order mode checking
inferred← citeshttps://doi.org/10.1137/s0097539701394511openalex-snapshot
Macro Tree Translations of Linear Size Increase are MSO Definable
inferred← citeshttps://doi.org/10.1145/1706299.1706355openalex-snapshot
Higher-order multi-parameter tree transducers and recursion schemes for program verification
inferred← citeshttps://doi.org/10.1145/1707801.1706355openalex-snapshot
Higher-order multi-parameter tree transducers and recursion schemes for program verification
inferred← citeshttps://doi.org/10.1145/2103746.2103770openalex-snapshot
Functional programs as compressed data
inferred← citeshttps://doi.org/10.2197/ipsjjip.27.411openalex-snapshot
Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-26openalex-snapshot
Weighted Regular Tree Grammars with Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0683openalex-snapshot
Context-Free Grammars with Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1705.10699openalex-snapshot
Pumping Lemma for Higher-order Languages
inferred← citeshttps://doi.org/10.5860/choice.48-6328openalex-snapshot
Foundations of XML processing: the tree-automata approach
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.