On the public citation graph
Mappings and grammars on trees
0 signed · 332 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/s0019-9958(67)90353-1openalex-snapshot
Algebraic automata and context-free sets
inferredcites →https://doi.org/10.1016/s0019-9958(68)90374-4openalex-snapshot
Algebra automata I: Parallel programming as a prolegomena to the categorical approach
inferredcites →https://doi.org/10.1016/s0019-9958(68)90917-0openalex-snapshot
The minimalization of tree automata
inferredcites →https://doi.org/10.1016/s0019-9958(69)90065-5openalex-snapshot
Tree generating regular systems
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)80041-1openalex-snapshot
Tree acceptors and some of their applications
inferredcites →https://doi.org/10.1090/psapm/019/0239886openalex-snapshot
Mathematical theory of automata
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1109/swat.1968.5openalex-snapshot
Automaton analogs of syntax directed translation schemata
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars
inferredcites →https://doi.org/10.1145/357980.357986openalex-snapshot
A syntax directed compiler for ALGOL 60
inferredcites →https://doi.org/10.1145/366062.366083openalex-snapshot
A syntax directed compiler for ALGOL 60
inferredcites →https://doi.org/10.1145/800169.805425openalex-snapshot
Translations on a context free grammar
inferredcites →https://doi.org/10.1145/800169.805427openalex-snapshot
Transformations and translations from the point of view of generalized finite automata theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-684x(199805)29:5<84::aid-scj9>3.0.co;2-jopenalex-snapshot
Left-right trees, a new tree structure for machine translation
inferred← citeshttps://doi.org/10.1006/inco.1995.1043openalex-snapshot
A Kleene Theorem for a Class of Planar Acyclic Graphs
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.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.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.1006/jcss.2001.1816openalex-snapshot
Output String Languages of Compositions of Deterministic Macro Tree Transducers
inferred← citeshttps://doi.org/10.1007/10705424_8openalex-snapshot
Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers
inferred← citeshttps://doi.org/10.1007/11605157_11openalex-snapshot
Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton
inferred← citeshttps://doi.org/10.1007/11812128_11openalex-snapshot
Tiburon: A Weighted Tree Automata Toolkit
inferred← citeshttps://doi.org/10.1007/11812128_15openalex-snapshot
Does o-Substitution Preserve Recognizability?
inferred← citeshttps://doi.org/10.1007/11965893_18openalex-snapshot
Exact XML Type Checking in Polynomial Time
inferred← citeshttps://doi.org/10.1007/3-540-06859-7_129openalex-snapshot
Tree structures handling by aps
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-07142-3_84openalex-snapshot
An algebraic formulation of the Chomsky hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-07389-2_228openalex-snapshot
An algebraic theory of formal languages
inferred← citeshttps://doi.org/10.1007/3-540-07407-4_21openalex-snapshot
Tree-transducers and syntax-connected transductions
inferred← citeshttps://doi.org/10.1007/3-540-07407-4_29openalex-snapshot
Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik?
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-08860-1_3openalex-snapshot
Sur l'inversion des morphismes d'arbres
inferred← citeshttps://doi.org/10.1007/3-540-10250-7_26openalex-snapshot
Tree-affix dendrogrammars for languages and compilers
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_68openalex-snapshot
Grammars without erasing rules. the OI case
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_74openalex-snapshot
Differents types de derivations infinies dans les grammaires algebriques d'arbres
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_25openalex-snapshot
Reducing algebraic tree grammars
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-44957-4_76openalex-snapshot
A Formal Model for an Expressive Fragment of XSLT
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-45104-8_32openalex-snapshot
TREEBAG — a Short Presentation
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_13openalex-snapshot
Relating Accumulative and Non-accumulative Functional Programs
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-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-51498-8_27openalex-snapshot
Inducibility of the composition of frontier-to-root tree transformations
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_43openalex-snapshot
Tree language problems in pattern recognition theory
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-61064-2_28openalex-snapshot
A pumping lemma for output languages of macro tree transducers
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-1-4613-3394-4_5openalex-snapshot
Block-Synchronization Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-030-21500-2_5openalex-snapshot
Characterizing Compatible View Updates in Syntactic Bidirectionalization
inferred← citeshttps://doi.org/10.1007/978-3-030-23679-3_10openalex-snapshot
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs
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-032-02602-6_12openalex-snapshot
Shape Preserving 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-23021-4_16openalex-snapshot
Complexity of Uniform Membership of Context-Free Tree Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_37openalex-snapshot
Linear Context-Free Tree Languages and Inverse Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-319-40946-7_23openalex-snapshot
Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_27openalex-snapshot
Relating Tree Series Transducers and Weighted Tree Automata
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-46464-8_2openalex-snapshot
Tree Languages Generated by Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_13openalex-snapshot
Benefits of Tree Transducers for Optimizing Functional Programs
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-75414-5_3openalex-snapshot
From Tree-Based Generators to Delegation Networks
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_14openalex-snapshot
Applications of Weighted Automata in Natural Language Processing
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-14684-8_8openalex-snapshot
Compositions of Top-Down Tree Transducers with ε-Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-23211-4_1openalex-snapshot
Tree Transformations and Dependencies
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-31653-1_33openalex-snapshot
Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars
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-66319-2_12openalex-snapshot
Über die Entscheidbarkeit der Formalen Erreichbarkeit von Prozeduren bei Monadischen Programmen
inferred← citeshttps://doi.org/10.1007/978-3-642-67458-7_16openalex-snapshot
A New Approach to Formal Syntax
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-44121-3_12openalex-snapshot
The Cantor-Bendixson Analysis of Finite Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-44121-3_6openalex-snapshot
A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_17openalex-snapshot
Decision Problems of Tree Transducers with Origin
inferred← citeshttps://doi.org/10.1007/978-3-662-53042-9_5openalex-snapshot
On the Mild Context-Sensitivity of k-Tree Wrapping Grammar
inferred← citeshttps://doi.org/10.1007/bf00288636openalex-snapshot
On procedures as open subroutines. II
inferred← citeshttps://doi.org/10.1007/bf00289307openalex-snapshot
The formal power of one-visit attribute grammars
inferred← citeshttps://doi.org/10.1007/bf00289503openalex-snapshot
On procedures as open subroutines. I
inferred← citeshttps://doi.org/10.1007/bf00996819openalex-snapshot
Conversion and parsing of tree transducers for syntactic pattern analysis
inferred← citeshttps://doi.org/10.1007/bf01178667openalex-snapshot
Synthesized and inherited functions
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/bf01683261openalex-snapshot
On the complexity of finite, pushdown, and stack automata
inferred← citeshttps://doi.org/10.1007/bf01683280openalex-snapshot
Top-down tree transducers with regular look-ahead
inferred← citeshttps://doi.org/10.1007/bf01704020openalex-snapshot
Bottom-up and top-down tree transformations— a comparison
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/bf01776568openalex-snapshot
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
inferred← citeshttps://doi.org/10.1007/bf01795940openalex-snapshot
Cascades of tree-automata and computations in universal algebras
inferred← citeshttps://doi.org/10.1007/bf02088010openalex-snapshot
Variants of top-down tree transducers with look-ahead
inferred← citeshttps://doi.org/10.1007/bf02575971openalex-snapshot
Un theoreme de Chomsky-Schützenberger pour les forets algebriques
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/bfb0017471openalex-snapshot
Graph grammars and tree transducers
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-008-9125-yopenalex-snapshot
Composing Stack-Attributed Tree Transducers
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-009-0105-8openalex-snapshot
Extended multi bottom–up tree transducers
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/s00236-018-0325-xopenalex-snapshot
Weighted iterated linear control
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/s10590-008-9039-0openalex-snapshot
Capturing practical natural language transformations
inferred← citeshttps://doi.org/10.1007/s10849-009-9109-6openalex-snapshot
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
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/0020-0255(82)90054-8openalex-snapshot
Pebble machines and tree walking machines
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(81)90027-1openalex-snapshot
Interdependent translation schemes
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90014-1openalex-snapshot
Deterministic tree pushdown automata and monadic tree rewriting systems
inferred← citeshttps://doi.org/10.1016/0031-3203(73)90027-7openalex-snapshot
Remarks on some aspects of language structure and their relevance to pattern analysis
inferred← citeshttps://doi.org/10.1016/0167-6423(89)90015-4openalex-snapshot
Bottom-up tree acceptors
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(82)90098-6openalex-snapshot
Morphismes et bimorphismes d'arbres
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90146-9openalex-snapshot
Systolic trees and systolic language recognition by tree automata
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(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(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)90099-xopenalex-snapshot
Synchronized tree automata
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/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/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.2008.03.019openalex-snapshot
Compositions of extended top-down tree transducers
inferred← citeshttps://doi.org/10.1016/j.ic.2018.02.011openalex-snapshot
Decision problems of tree transducers with origin
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104454openalex-snapshot
Linear context-free tree languages and inverse homomorphisms
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.2004.10.008openalex-snapshot
Linearity and nondeletion on monadic context-free tree grammars
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.jlap.2006.11.001openalex-snapshot
Deaccumulation techniques for improving provability
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.026openalex-snapshot
Compositions of tree series transformations
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.007openalex-snapshot
Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
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/s0019-9958(71)90706-6openalex-snapshot
Translations on a context free grammar
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90489-1openalex-snapshot
On the syntactic structures of unrestricted grammars I. Generative grammars and phrase structure grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90495-7openalex-snapshot
On the syntactic structures of unrestricted grammars II. Automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90042-6openalex-snapshot
Context-dependent tree automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90344-3openalex-snapshot
Semantic-syntax-directed translation
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90510-7openalex-snapshot
Forêts Algébriques et Homomorphismes Inverses
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)90561-8openalex-snapshot
Composition of top-down and bottom-up tree transductions
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(80)90698-1openalex-snapshot
Une propri\'et\'e des forêts alg\'ebriques « de greibach \ra
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90299-0openalex-snapshot
An extension of tree adjunct grammars
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/s0019-9958(86)80043-2openalex-snapshot
Machines for 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(74)80031-0openalex-snapshot
A generalized approach to formal languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80045-6openalex-snapshot
Natural state transformations
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80032-3openalex-snapshot
Un théorème de duplication pour les forêts algébriques
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80040-2openalex-snapshot
Intercalation lemmas for tree transducer languages
inferred← citeshttps://doi.org/10.1016/s0076-5392(09)60475-6openalex-snapshot
Appendix I Tree Grammars for Syntactic Pattern Recognition
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73837-4openalex-snapshot
About Ordered Sets in Algebraic Semantics
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00168-7openalex-snapshot
Tree-based picture generation
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(01)00197-9openalex-snapshot
Decidability of EDT0L structural equivalence
showing the first 200 of 315 · page through all 315
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.