On the public citation graph
Three hierarchies of transducers
0 signed · 107 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_5openalex-snapshot
Three useful results concerning L languages without interactions
inferredcites →https://doi.org/10.1007/3-540-08342-1_11openalex-snapshot
Serial composition of 2-way finite-state transducers and simple programs on strings
inferredcites →https://doi.org/10.1007/bf00264471openalex-snapshot
Iterated deterministic substitution
inferredcites →https://doi.org/10.1007/bf00264603openalex-snapshot
Hierarchy theorems for two-way finite state transducers
inferredcites →https://doi.org/10.1007/bf00985664openalex-snapshot
Extension of tabled 0L-systems and languages
inferredcites →https://doi.org/10.1007/bf01683280openalex-snapshot
Top-down tree transducers with regular look-ahead
inferredcites →https://doi.org/10.1007/bf01704020openalex-snapshot
Bottom-up and top-down tree transformations— a comparison
inferredcites →https://doi.org/10.1016/0020-0190(78)90060-1openalex-snapshot
On tree transducers for partial functions
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/0022-0000(82)90019-8openalex-snapshot
The copying power of one-state tree transducers
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/0304-3975(78)90035-xopenalex-snapshot
One way finite visit automata
inferredcites →https://doi.org/10.1016/s0019-9958(71)90483-9openalex-snapshot
Two-way sequential transductions and stack automata
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(77)90308-4openalex-snapshot
Controlled iteration grammars and full hyper-AFL's
inferredcites →https://doi.org/10.1016/s0019-9958(78)90538-7openalex-snapshot
Tree transducers and tree languages
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(67)80022-9openalex-snapshot
Characterizing derivation trees of context-free grammars through a generalization of finite 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(70)80027-7openalex-snapshot
A characterization of two-way deterministic classes of languages
inferredcites →https://doi.org/10.1016/s0022-0000(72)80025-4openalex-snapshot
Absolutely parallel grammars and two-way finite-state transducers
inferredcites →https://doi.org/10.1016/s0022-0000(72)80039-4openalex-snapshot
Syntactic operators on full semiAFLs
inferredcites →https://doi.org/10.1016/s0022-0000(75)80017-1openalex-snapshot
Two-way a-transducers and AFL
inferredcites →https://doi.org/10.1016/s0022-0000(76)80040-2openalex-snapshot
Intercalation lemmas for tree transducer languages
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.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1976.35openalex-snapshot
Variations of a new machine model
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1137/0205022openalex-snapshot
Decomposition Theorems for Various Kinds of Languages Parallel in Nature
inferredcites →https://doi.org/10.1137/0207030openalex-snapshot
Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
inferredcites →https://doi.org/10.1145/1008335.1008341openalex-snapshot
Review of "Algebraic and automata-theoretic properties of formal languages" by Seymour Ginsburg. North Holland, 1975.
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars
inferredcites →https://doi.org/10.1145/322169.322178openalex-snapshot
Stack Machines and Classes of Nonnested Macro Languages
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.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
inferredcites →https://doi.org/10.2977/prims/1195192738openalex-snapshot
On Derivation Trees of Indexed Grammars – An Extension of the uvwxy-Theorem
inferredcites →https://doi.org/10.7146/dpb.v2i18.6437openalex-snapshot
MACROS, Iterated Substitution and Lindenmayer AFLs
inferredcites →https://doi.org/10.7146/dpb.v7i91.6507openalex-snapshot
The Copying Power of One-State Tree Transducers
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.1998.2736openalex-snapshot
The Generating Power of Total Deterministic Tree Transducers
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/inco.2001.3039openalex-snapshot
The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree 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/11779148_20openalex-snapshot
Hierarchies of Tree Series Transformations Revisited
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_21openalex-snapshot
Branching Grammars: A Generalization of ET0L Systems
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_19openalex-snapshot
Two-Way Finite State Transducers with Nested Pebbles
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_19openalex-snapshot
Hierarchies of String Languages Generated by Deterministic Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_19openalex-snapshot
Exponential output size of top-down tree transducers
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_28openalex-snapshot
Two-way finite state transducers and monadic second-order logic
inferred← citeshttps://doi.org/10.1007/978-3-031-40247-0_16openalex-snapshot
Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_34openalex-snapshot
Automata-Based Analysis of Recursive Cryptographic Protocols
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-95486-3_8openalex-snapshot
The ETOL Hierarchy is in the oi Hierarchy
inferred← citeshttps://doi.org/10.1007/978-94-015-9634-3_15openalex-snapshot
An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy
inferred← citeshttps://doi.org/10.1007/bf01184813openalex-snapshot
Superlinear Deterministic Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1007/bf02915449openalex-snapshot
High level tree transducers and iterated pushdown tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0016288openalex-snapshot
The OI-hierarchy is closed under control
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-9660-2openalex-snapshot
Composition Closure of Linear Extended Top-down 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-015-0224-3openalex-snapshot
Two-way pebble transducers for partial functions and their composition
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/0022-0000(85)90006-6openalex-snapshot
Hierarchies of hyper-AFLs
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90009-3openalex-snapshot
The IO- and OI-hierarchies
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/0890-5401(88)90026-0openalex-snapshot
The OI-hierarchy is closed under control
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/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.
inferred← citeshttps://doi.org/10.1016/j.ic.2007.08.003openalex-snapshot
Transducer-based analysis of cryptographic protocols
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.jcss.2003.10.001openalex-snapshot
Branching synchronization grammars with nested tables
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.2018.03.014openalex-snapshot
Multiple context-free tree grammars: Lexicalization and characterization
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90172-2openalex-snapshot
Space-bounded complexity classes and iterated deterministic substitution
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(01)00354-1openalex-snapshot
Algebraic aspects of families of fuzzy languages
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.1017/s1446788723000010openalex-snapshot
MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
inferred← citeshttps://doi.org/10.1137/0215005openalex-snapshot
The Complexity of Languages Generated by Attribute Grammars
inferred← citeshttps://doi.org/10.1137/070699160openalex-snapshot
The Power of Extended Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1145/371316.371512openalex-snapshot
MSO definable string transductions and two-way finite-state transducers
inferred← citeshttps://doi.org/10.25596/jalc-2002-011openalex-snapshot
Bottom-Up and Top-Down Tree Series Transformations
inferred← citeshttps://doi.org/10.25596/jalc-2005-535openalex-snapshot
Incomparability Results for Classes of Polynomial Tree Series Transformations
inferred← citeshttps://doi.org/10.25596/jalc-2008-003openalex-snapshot
Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers
inferred← citeshttps://doi.org/10.31274/rtd-180813-8555openalex-snapshot
Hypertrees: a study in language specification
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.48550/arxiv.1301.1514openalex-snapshot
Composition Closure of Linear Extended Top-down 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.