On the public citation graph
Top-down tree transducers with regular look-ahead
0 signed · 165 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/bf01704020openalex-snapshot
Bottom-up and top-down tree transformations— a comparison
inferredcites →https://doi.org/10.1007/bf02463499openalex-snapshot
Conference on Formal Languages, Automata and Development
inferredcites →https://doi.org/10.1016/0304-3975(76)90003-7openalex-snapshot
Surface tree languages and parallel derivation trees
inferredcites →https://doi.org/10.1016/s0019-9958(77)90308-4openalex-snapshot
Controlled iteration grammars and full hyper-AFL's
inferredcites →https://doi.org/10.1016/s0022-0000(70)80017-4openalex-snapshot
Generalized2 sequential machine maps
inferredcites →https://doi.org/10.1016/s0022-0000(73)80050-9openalex-snapshot
LR-regular grammars—an extension of LR(k) grammars
inferredcites →https://doi.org/10.1051/ita/197610r100051openalex-snapshot
Transductions de forêts reconnaissables monadiques, forêts corégulières
inferredcites →https://doi.org/10.1145/800125.804051openalex-snapshot
Tree transductions and families of tree languages
inferredcites →https://doi.org/10.1145/800152.804915openalex-snapshot
Compositions of n tree transducers
inferredcites →https://doi.org/10.1145/800152.804917openalex-snapshot
Developmental systems and languages
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
inferredcites →https://doi.org/10.7146/dpb.v4i44.6464openalex-snapshot
Surface Tree Languages and Parallel Derivation Trees
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.1999.1684openalex-snapshot
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
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-10828-9_69openalex-snapshot
Proprietes de cloture d'une extension de transducteurs d'arbres deterministes
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_32openalex-snapshot
An axiomatic approach to the Korenjak - Hopcroft algorithms
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_34openalex-snapshot
Alphabetic Pushdown Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_17openalex-snapshot
Iterated deterministic top-down look-ahead
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_27openalex-snapshot
Inducibility of the composition of frontier-to-root tree transformations
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_10openalex-snapshot
Decidability of equivalence for linear letter to letter top-down tree transducers
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/3-540-59293-8_193openalex-snapshot
The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
inferred← citeshttps://doi.org/10.1007/978-3-030-17127-8_28openalex-snapshot
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-030-23679-3_11openalex-snapshot
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-030-23679-3_19openalex-snapshot
Streaming Ranked-Tree-to-String Transducers
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_16openalex-snapshot
Context-Free Grammars with Lookahead
inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_24openalex-snapshot
Definability Results for Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_6openalex-snapshot
Compositions of Constant Weighted Extended Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-031-19685-0_13openalex-snapshot
How to Decide Functionality of Compositions of Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-031-40247-0_17openalex-snapshot
Deciding Whether an Attributed Translation Can Be Realized by a Top-Down Transducer
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_16openalex-snapshot
Attributed Tree Transducers for Partial Functions
inferred← citeshttps://doi.org/10.1007/978-3-032-02602-6_12openalex-snapshot
Shape Preserving Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-032-02602-6_9openalex-snapshot
Dynamically Weighted Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_10openalex-snapshot
How to Remove the Look-Ahead of Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_7openalex-snapshot
Equivalence of Symbolic Tree Transducers
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-30586-6_1openalex-snapshot
An Overview of Probabilistic Tree Transducers for Natural Language Processing
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_14openalex-snapshot
Tree-Series-to-Tree-Series Transformations
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_23openalex-snapshot
Extended Multi Bottom-Up Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_9openalex-snapshot
Weighted Tree Automata and Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-11881-4openalex-snapshot
Automata for Branching and Layered Temporal Structures : An Investigation into Regularities of Infinite Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_18openalex-snapshot
Minimization of Deterministic Bottom-Up Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_29openalex-snapshot
Input Products for Weighted Extended Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_13openalex-snapshot
Controlled Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-24897-9_13openalex-snapshot
Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_21openalex-snapshot
Visibly Pushdown Transducers with Look-Ahead
inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_25openalex-snapshot
Learning Rational Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_22openalex-snapshot
Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_15openalex-snapshot
Determinacy and Rewriting of Top-Down and MSO Tree Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-83030-3_9openalex-snapshot
Syntax Directed Translation in the Natural Language Information System PLIDIS
inferred← citeshttps://doi.org/10.1007/bf00288769openalex-snapshot
Sur les g�n�rateurs alg�briques et lin�aires
inferred← citeshttps://doi.org/10.1007/bf01305313openalex-snapshot
A hierarchy of deterministic top-down tree transformations
inferred← citeshttps://doi.org/10.1007/bf01744577openalex-snapshot
An axiomatic approach to the Korenjak-Hopcroft algorithms
inferred← citeshttps://doi.org/10.1007/bf02088010openalex-snapshot
Variants of top-down tree transducers with look-ahead
inferred← citeshttps://doi.org/10.1007/bf02915449openalex-snapshot
High level tree transducers and iterated pushdown tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0017471openalex-snapshot
Graph grammars and tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0029966openalex-snapshot
On the generation of trees by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/s00224-003-1072-zopenalex-snapshot
Tree Series Transformations that Respect Copying
inferred← citeshttps://doi.org/10.1007/s00224-015-9647-zopenalex-snapshot
Erratum to: “Top-down Tree Transducers with Regular Look-ahead”
inferred← citeshttps://doi.org/10.1007/s00224-015-9660-2openalex-snapshot
Composition Closure of Linear Extended Top-down Tree Transducers
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/s00236-009-0105-8openalex-snapshot
Extended multi bottom–up 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.1016/0020-0190(78)90060-1openalex-snapshot
On tree transducers for partial functions
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90178-6openalex-snapshot
Top-down tree transducers with deterministic top-down look-ahead
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90058-6openalex-snapshot
Tree transducers, L systems, and two-way machines
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90019-8openalex-snapshot
The copying power of one-state tree transducers
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90052-6openalex-snapshot
Pushdown machines for the macro tree transducer
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90312-popenalex-snapshot
A complete classification of deterministic root-to-frontier tree transformation classes
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)00303-3openalex-snapshot
Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00073-4openalex-snapshot
Decidability of equivalence for deterministic synchronized tree automata
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/j.ic.2008.03.019openalex-snapshot
Compositions of extended top-down tree transducers
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105111openalex-snapshot
Transduction from trees to graphs through folding
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105131openalex-snapshot
Functionality of compositions of top-down tree transducers is decidable
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.03.014openalex-snapshot
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.01.002openalex-snapshot
Balancedness of MSO transductions in polynomial time
inferred← citeshttps://doi.org/10.1016/j.jal.2011.11.003openalex-snapshot
Translating regular expression matching into transducers
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.10.001openalex-snapshot
Branching synchronization grammars with nested tables
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.01.001openalex-snapshot
Deciding equivalence of top–down XML transformations in polynomial time
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.05.003openalex-snapshot
Linking theorems for tree transducers
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.11.001openalex-snapshot
Determinacy and rewriting of functional top–down and MSO tree transformations
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.07.002openalex-snapshot
Copyless cost-register automata: Structure, expressiveness, and closure properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.001openalex-snapshot
Hierarchies of tree series transformations
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.007openalex-snapshot
Storage-to-tree transducers with look-ahead
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.025openalex-snapshot
Linear deterministic multi bottom-up tree transducers
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.028openalex-snapshot
Equational tree transformations
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.005openalex-snapshot
Look-ahead removal for total deterministic top-down tree transducers
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.014openalex-snapshot
Multiple context-free tree grammars: Lexicalization and characterization
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.033openalex-snapshot
Streaming ranked-tree-to-string transducers
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.05.027openalex-snapshot
Deterministic top-down tree automata with Boolean deterministic look-ahead
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90635-1openalex-snapshot
Bounded nesting in macro grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90641-7openalex-snapshot
Substitutions dans les EDT0L systèmes ultralinéaires
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90438-1openalex-snapshot
Parallel and two-way automata on directed ordered acyclic graphs
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.1016/s0304-3975(00)00280-2openalex-snapshot
Tree-based generation of languages of fractals
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00332-5openalex-snapshot
Compositions with superlinear deterministic top-down tree transformations
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00296-0openalex-snapshot
Alphabetic and synchronized tree 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.1051/ita/1981150302131openalex-snapshot
Transducteurs finis d'arbres et tests d'égalité
inferred← citeshttps://doi.org/10.1051/ita/1994280504471openalex-snapshot
Decidability of equivalence for a class of non-deterministic tree transducers
inferred← citeshttps://doi.org/10.1109/synasc.2010.50openalex-snapshot
Translating Regular Expression Matching into Transducers
inferred← citeshttps://doi.org/10.1137/070699160openalex-snapshot
The Power of Extended Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1137/s0097539701394511openalex-snapshot
Macro Tree Translations of Linear Size Increase are MSO Definable
inferred← citeshttps://doi.org/10.1142/s0129054110007234openalex-snapshot
PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS
inferred← citeshttps://doi.org/10.1142/s012905411100891xopenalex-snapshot
EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS
inferred← citeshttps://doi.org/10.1142/s0129054115400134openalex-snapshot
A Survey on Decidable Equivalence Problems for Tree Transducers
inferred← citeshttps://doi.org/10.1142/s0129054122440051openalex-snapshot
Definability Results for Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1142/s0129054122450010openalex-snapshot
Compositions with Constant Weighted Extended Tree Transducers
inferred← citeshttps://doi.org/10.1142/s0129054125410059openalex-snapshot
Deciding Whether an Attributed Translation can be Realized by a Top-Down Transducer
inferred← citeshttps://doi.org/10.1142/s0218196726500165openalex-snapshot
On groups with EDT0L word problem
inferred← citeshttps://doi.org/10.1145/1480945.1480955openalex-snapshot
Type-based specialization of xml transformations
inferred← citeshttps://doi.org/10.1145/1807085.1807122openalex-snapshot
A learning algorithm for top-down XML transformations
inferred← citeshttps://doi.org/10.1145/2429069.2429083openalex-snapshot
Static and dynamic semantics of NoSQL languages
inferred← citeshttps://doi.org/10.1145/2480359.2429083openalex-snapshot
Static and dynamic semantics of NoSQL languages
inferred← citeshttps://doi.org/10.1145/3182653openalex-snapshot
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
inferred← citeshttps://doi.org/10.1145/371316.371512openalex-snapshot
MSO definable string transductions and two-way finite-state transducers
inferred← citeshttps://doi.org/10.1145/3808330openalex-snapshot
An Efficient Algorithm for Streaming BPE Tokenization
inferred← citeshttps://doi.org/10.1145/800133.804333openalex-snapshot
Tree transducers, L systems and two-way machines (Extended Abstract)
inferred← citeshttps://doi.org/10.1162/coli.2008.07-051-r2-03-57openalex-snapshot
Training Tree Transducers
inferred← citeshttps://doi.org/10.14232/actacyb.20.2.2011.2openalex-snapshot
Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power
inferred← citeshttps://doi.org/10.1587/transinf.2015fop0007openalex-snapshot
Query Rewriting for Nondeterministic Tree Transducers
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.248openalex-snapshot
Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.1268openalex-snapshot
Deciding Schema k-Secrecy for XML Databases
inferred← citeshttps://doi.org/10.2197/ipsjjip.31.421openalex-snapshot
Derivatives of Context-free Grammars with Lookahead
inferred← citeshttps://doi.org/10.2197/ipsjtrans.2.175openalex-snapshot
Computing the Cost of Typechecking of Composition of Macro Tree Transducers
inferred← citeshttps://doi.org/10.2197/ipsjtrans.7.82openalex-snapshot
Checking Time Linearity of Regular Expression Matching Based on Backtracking
inferred← citeshttps://doi.org/10.25596/jalc-2002-011openalex-snapshot
Bottom-Up and Top-Down Tree Series Transformations
inferred← citeshttps://doi.org/10.31274/rtd-180813-8555openalex-snapshot
Hypertrees: a study in language specification
inferred← citeshttps://doi.org/10.3233/fi-1996-263403openalex-snapshot
A LOWER BOUND ON THE GROWTH OF FUNCTIONS COMPUTED BY TREE TRANSDUCERS
inferred← citeshttps://doi.org/10.3233/fi-2011-559openalex-snapshot
Weighted Extended Tree Transducers
inferred← citeshttps://doi.org/10.3233/fi-2011-589openalex-snapshot
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
inferred← citeshttps://doi.org/10.4204/eptcs.151.5openalex-snapshot
Equivalence Problems for Tree Transducers: A Brief Survey
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1757openalex-snapshot
The Complexity of Tree Transducer Output Languages
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.90openalex-snapshot
Decision Problems for Origin-Close Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1514openalex-snapshot
Composition Closure of Linear Extended Top-down Tree Transducers
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2400openalex-snapshot
Look-Ahead Removal for Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0683openalex-snapshot
Context-Free Grammars with Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1504.01709openalex-snapshot
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties
inferred← citeshttps://doi.org/10.5860/choice.48-6328openalex-snapshot
Foundations of XML processing: the tree-automata approach
inferred← citeshttps://doi.org/10.70675/5e0f5705z8360z4a62zb884z5db7671051c1openalex-snapshot
A mechanized theory of regular trees in dependent type theory
inferred← citeshttps://doi.org/10.70675/f75c9021ze6c6z4173zb14dz83df1966a3e2openalex-snapshot
Programmation logique inductive pour la classification et la transformation de documents semi-structurés
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.