On the public citation graph
Equivalence of finite-valued tree transducers is decidable
0 signed · 38 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-19027-9_17openalex-snapshot
Code selection techniques: Pattern matching, tree parsing, and inversion of derivors
inferredcites →https://doi.org/10.1007/bf00263578openalex-snapshot
On the finite degree of ambiguity of finite tree automata
inferredcites →https://doi.org/10.1007/bf00264285openalex-snapshot
On the valuedness of finite transducers
inferredcites →https://doi.org/10.1007/bf01185566openalex-snapshot
On the lengths of values in a finite transducer
inferredcites →https://doi.org/10.1007/bfb0016250openalex-snapshot
The equivalence of finite valued transducers (on HDTOL languages) is decidable
inferredcites →https://doi.org/10.1016/0304-3975(76)90026-8openalex-snapshot
Sur les relations rationnelles entre monoides libres
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)90024-xopenalex-snapshot
Attribute grammars and recursive program schemes II
inferredcites →https://doi.org/10.1016/0304-3975(86)90134-9openalex-snapshot
The equivalence of finite valued transducers (on HDT0L languages) is decidable
inferredcites →https://doi.org/10.1016/0304-3975(91)90381-bopenalex-snapshot
On the degree of ambiguity of finite automata
inferredcites →https://doi.org/10.1016/0304-3975(92)90281-jopenalex-snapshot
Single-valuedness of tree transducers is decidable in polynomial time
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.1137/0222014openalex-snapshot
Decomposing Finite-Valued Transducers and Deciding Their Equivalence
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.1007/978-0-387-09680-3_29openalex-snapshot
Regular n-ary Queries in Trees and Variable Independence
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_32openalex-snapshot
Properties of Visibly Pushdown Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_32openalex-snapshot
Symbolic Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_30openalex-snapshot
Determinacy and Subsumption for Single-Valued Bottom-Up 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.1016/j.ic.2010.08.003openalex-snapshot
Queries on Xml streams with bounded delay and concurrency
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.2016.11.001openalex-snapshot
Determinacy and rewriting of functional top–down and MSO tree transformations
inferred← citeshttps://doi.org/10.1051/ita/1996300503791openalex-snapshot
Decomposing a $k$-valued transducer into $k$ unambiguous ones
inferred← citeshttps://doi.org/10.1142/s0129054115400134openalex-snapshot
A Survey on Decidable Equivalence Problems for Tree Transducers
inferred← citeshttps://doi.org/10.1145/2103621.2103674openalex-snapshot
Symbolic finite state transducers
inferred← citeshttps://doi.org/10.1145/2103656.2103674openalex-snapshot
Symbolic finite state transducers
inferred← citeshttps://doi.org/10.1145/2502488.2502489openalex-snapshot
Programming macro tree transducers
inferred← citeshttps://doi.org/10.1145/3661814.3662095openalex-snapshot
Finite-valued Streaming String Transducers
inferred← citeshttps://doi.org/10.1587/transinf.2015fcp0015openalex-snapshot
Determinacy and Subsumption of Single-Valued Bottom-Up Tree Transducers
inferred← citeshttps://doi.org/10.1587/transinf.2015fop0007openalex-snapshot
Query Rewriting for Nondeterministic Tree Transducers
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.2014.133openalex-snapshot
Finite-Valued Weighted Automata
inferred← citeshttps://doi.org/10.70675/5e0f5705z8360z4a62zb884z5db7671051c1openalex-snapshot
A mechanized theory of regular trees in dependent type theory
inferred← citeshttps://doi.org/10.70675/72be09d6z242fz4778za1c9za96ca334e3dcopenalex-snapshot
Problèmes de bornes pour les automates et les transducteurs à pile visible
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.