On the public citation graph
Bottom-up and top-down tree transformations— a comparison
0 signed · 267 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/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
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)80041-1openalex-snapshot
Tree acceptors and some of their applications
inferredcites →https://doi.org/10.1145/800125.804051openalex-snapshot
Tree transductions and families of tree 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.1995.1016openalex-snapshot
Attributed Tree Transducers Cannot Induce All Deterministic Bottom-up Tree Transformations
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.1996.0048openalex-snapshot
Language Theoretic and Algorithmic Properties ofd-dimensional Collages and Patterns in a Grid
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.1007/11505877_30openalex-snapshot
The Power of Tree Series Transducers of Type I and II
inferred← citeshttps://doi.org/10.1007/11779148_20openalex-snapshot
Hierarchies of Tree Series Transformations Revisited
inferred← citeshttps://doi.org/10.1007/11812128_11openalex-snapshot
Tiburon: A Weighted Tree Automata Toolkit
inferred← citeshttps://doi.org/10.1007/11823230_5openalex-snapshot
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-07142-3_62openalex-snapshot
Categorical theory of tree processing
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_4openalex-snapshot
On a description of tree-languages by languages
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_17openalex-snapshot
Macro grammars, lindenmayer systems and other copying devices
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_41openalex-snapshot
Rational relations of binary trees
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_75openalex-snapshot
Universal Algebras and Tree Automata
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_3openalex-snapshot
Sur l'inversion des morphismes d'arbres
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_29openalex-snapshot
Parallel and two-way recognizers of directed acyclic graphs
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-12727-5_9openalex-snapshot
Continuite des transducteurs d'etats finis d'arbres
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_19openalex-snapshot
Synchronized bottom-up tree automata and L-systems
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_9openalex-snapshot
A gap between linear and non linear term-rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_24openalex-snapshot
The Complexity of Compositions of Deterministic Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-44543-9_6openalex-snapshot
Structured Document Transformations Based on XSL
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_34openalex-snapshot
Alphabetic Pushdown Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_46openalex-snapshot
Extrapolating Tree Transformations
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_40openalex-snapshot
Homomorphisms and concurrent term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_126openalex-snapshot
Fair termination is decidable for ground systems
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-51498-8_3openalex-snapshot
Interpretations of synchronous flowchart schemes
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_34openalex-snapshot
Proofs and reachability problem for ground rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_26openalex-snapshot
Recursively defined tree transductions
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_191openalex-snapshot
First-order logic on finite trees
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/3-540-61064-2_28openalex-snapshot
A pumping lemma for output languages of macro tree transducers
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-61735-3_13openalex-snapshot
A strict border for the decidability of E-unification for recursive functions
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-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_16openalex-snapshot
Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable
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-08846-4_22openalex-snapshot
Pushdown Machines for Weighted Context-Free Tree Translation
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-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_11openalex-snapshot
Multi-Return Macro Tree Transducers
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-73420-8_54openalex-snapshot
Categorical Views on Computations on Trees (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-76336-9_25openalex-snapshot
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_10openalex-snapshot
Classes of Tree Homomorphisms with Decidable Preservation of Regularity
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-00982-2_61openalex-snapshot
A Kleene Theorem for Forest Languages
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-03564-7_20openalex-snapshot
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited
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-14684-8_8openalex-snapshot
Compositions of Top-Down Tree Transducers with ε-Rules
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-24897-9_6openalex-snapshot
Equational Weighted Tree Transformations with Discounting
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-31653-1_33openalex-snapshot
Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars
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.1007/978-3-642-60207-8_13openalex-snapshot
Full Abstract Families of Tree Series I
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/978-3-662-53042-9_12openalex-snapshot
A Single Movement Normal Form for Minimalist Grammars
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_24openalex-snapshot
Compositions of Tree-to-Tree Statistical Machine Translation Models
inferred← citeshttps://doi.org/10.1007/bf00264231openalex-snapshot
An effectively given initial semigroup
inferred← citeshttps://doi.org/10.1007/bf00289307openalex-snapshot
The formal power of one-visit attribute grammars
inferred← citeshttps://doi.org/10.1007/bf00996819openalex-snapshot
Conversion and parsing of tree transducers for syntactic pattern analysis
inferred← citeshttps://doi.org/10.1007/bf01184813openalex-snapshot
Superlinear Deterministic Top-Down Tree Transducers
inferred← citeshttps://doi.org/10.1007/bf01211311openalex-snapshot
An implementation of syntax directed functional programming on nested-stack machines
inferred← citeshttps://doi.org/10.1007/bf01305313openalex-snapshot
A hierarchy of deterministic top-down tree transformations
inferred← citeshttps://doi.org/10.1007/bf01683280openalex-snapshot
Top-down tree transducers with regular look-ahead
inferred← citeshttps://doi.org/10.1007/bf01744300openalex-snapshot
Le théorème de transversale rationnelle dans les langages d'arbres
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/bfb0015742openalex-snapshot
Characterization of high level tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0017142openalex-snapshot
Automata and rational expressions on planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0017476openalex-snapshot
A lower bound on the growth of functions computed by tree transductions
inferred← citeshttps://doi.org/10.1007/bfb0028794openalex-snapshot
Decidability of confluence for ground term rewriting systems
inferred← citeshttps://doi.org/10.1007/bfb0030595openalex-snapshot
Word-into-Trees Transducers with bounded difference
inferred← citeshttps://doi.org/10.1007/s00224-003-1072-zopenalex-snapshot
Tree Series Transformations that Respect Copying
inferred← citeshttps://doi.org/10.1007/s00224-004-1096-zopenalex-snapshot
A Kleene Theorem for Weighted Tree Automata
inferred← citeshttps://doi.org/10.1007/s00224-006-1235-9openalex-snapshot
Formal Efficiency Analysis for Tree Transducer Composition
inferred← citeshttps://doi.org/10.1007/s00224-010-9296-1openalex-snapshot
A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids
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/s002249910004openalex-snapshot
Spinal-Formed Context-Free Tree 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-011-0148-5openalex-snapshot
Equational weighted tree transformations
inferred← citeshttps://doi.org/10.1007/s00236-014-0197-7openalex-snapshot
Forward and backward application of symbolic tree transducers
inferred← citeshttps://doi.org/10.1007/s00500-015-1717-2openalex-snapshot
Characterizations of recognizable weighted tree languages by logic and bimorphisms
inferred← citeshttps://doi.org/10.1007/s10009-011-0205-yopenalex-snapshot
Abstract regular (tree) model checking
inferred← citeshttps://doi.org/10.1007/s10009-011-0208-8openalex-snapshot
Widening techniques for regular tree model checking
inferred← citeshttps://doi.org/10.1007/s10990-013-9093-zopenalex-snapshot
Functional programs as compressed data
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/0020-0255(76)90006-2openalex-snapshot
Augmented tranśition networks and their relation to tree transducers
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/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(76)90003-7openalex-snapshot
Surface tree languages and parallel derivation trees
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90008-7openalex-snapshot
A representation of trees by languages I
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90039-7openalex-snapshot
A representation of trees by languages II
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90003-2openalex-snapshot
Attribute grammars and recursive program schemes I
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot
Attribute grammars and recursive program schemes II
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90098-6openalex-snapshot
Morphismes et bimorphismes d'arbres
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90077-5openalex-snapshot
Alternating tree automata
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
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)90158-xopenalex-snapshot
Generalized automata on infinite trees and Muller-McNaughton's Theorem
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(91)90353-4openalex-snapshot
Modular tree transducers
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90376-dopenalex-snapshot
A complete description for a monoid of deterministic bottom-up 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(92)90348-jopenalex-snapshot
Alphabetic tree relations
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90191-uopenalex-snapshot
Tree transducers with external functions
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(94)90101-5openalex-snapshot
Bottom-up tree pushdown automata: classification and connection with rewrite systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90241-0openalex-snapshot
Undecidable properties of deterministic top-down tree transducers
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/b978-0-12-046370-1.50009-7openalex-snapshot
On Recognizable Sets and Tree Automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.015openalex-snapshot
Abstract Regular Tree Model Checking
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.ic.2024.105205openalex-snapshot
Rational weighted tree languages with storage
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.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.1016/j.jlap.2006.11.001openalex-snapshot
Deaccumulation techniques for improving provability
inferred← citeshttps://doi.org/10.1016/j.scico.2016.03.006openalex-snapshot
Generalising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain
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.2005.02.005openalex-snapshot
HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
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.2005.11.024openalex-snapshot
Closure properties of linear context-free tree languages with an application to optimality theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.025openalex-snapshot
Weighted tree automata and weighted logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.026openalex-snapshot
Compositions of tree series transformations
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.009openalex-snapshot
Defining syntax-directed translations by tree bimorphisms
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.028openalex-snapshot
Equational tree 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/j.tcs.2023.114197openalex-snapshot
Homomorphisms and inverse homomorphisms on graph-walking automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90538-7openalex-snapshot
Tree transducers and tree languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90611-3openalex-snapshot
Formal methodology of translation. I. Semantic preserving translations
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90623-xopenalex-snapshot
Formal methodology of translation. II. Capabilities and limitations
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90370-xopenalex-snapshot
Intertwined recursion, tree transformations and linear systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90561-8openalex-snapshot
Composition of top-down and bottom-up tree transductions
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/s0019-9958(81)90466-6openalex-snapshot
Passes and paths of attribute grammars
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/s0022-0000(75)80045-6openalex-snapshot
Natural state transformations
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80040-2openalex-snapshot
Intercalation lemmas for tree transducer languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00192-4openalex-snapshot
The component hierarchy of chain-free cooperating distributed regular tree grammars
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)00181-5openalex-snapshot
Iterated relabeling tree transducers
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00014-2openalex-snapshot
Réduction de la non-linéarité des morphismes d'arbres Recognizable tree-languages and non-linear morphisms
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00140-3openalex-snapshot
Shape preserving top-down tree transducers
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(97)00080-7openalex-snapshot
On the equivalence problem for letter-to-letter top-down tree transducers
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00263-6openalex-snapshot
Nondeterministic operations on finite relational structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00010-3openalex-snapshot
General varieties of tree languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00296-0openalex-snapshot
Alphabetic and synchronized tree transducers
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/s0956796803004933openalex-snapshot
Composition of functions with accumulating parameters
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/access.2022.3174192openalex-snapshot
An Interactive Interpreter for Two Dimensional Lucid
inferred← citeshttps://doi.org/10.1109/lics.1990.113750openalex-snapshot
The theory of ground rewrite systems is decidable
inferred← citeshttps://doi.org/10.1109/lics.2012.36openalex-snapshot
The HOM Problem is EXPTIME-Complete
inferred← citeshttps://doi.org/10.1109/mahc.1981.10006openalex-snapshot
Formal Languages: Origins and Directions
inferred← citeshttps://doi.org/10.1109/sfcs.1979.19openalex-snapshot
Formal languages: Origins and directions
inferred← citeshttps://doi.org/10.1109/swat.1973.5openalex-snapshot
Complexity of recognition in intermediate Level languages
inferred← citeshttps://doi.org/10.1109/tnnls.2012.2222044openalex-snapshot
Compositional Generative Mapping for Tree-Structured Data—Part I: Bottom-Up Probabilistic Modeling of Trees
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.1137/140999104openalex-snapshot
The HOM Problem is EXPTIME-Complete
inferred← citeshttps://doi.org/10.1142/s0129054106003899openalex-snapshot
DECIDABILITY OF THE SHAPE PRESERVING PROPERTY OF BOTTOM-UP TREE TRANSDUCERS
inferred← citeshttps://doi.org/10.1142/s012905410900653xopenalex-snapshot
DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA
inferred← citeshttps://doi.org/10.1142/s0129054110007234openalex-snapshot
PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS
showing the first 200 of 261 · page through all 261
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.