Extended multi bottom-up tree transducers
type: Item
instance of: scholarly article
title: Extended multi bottom-up tree transducers
zbMATH Open document ID: 1186.68254
author: Joost Engelfriet
author: Eric Lilin
author: Andreas Maletti
published in: Acta Informatica
publication date: 2009-11-18T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5634766
zbMATH Keywords: xtended top-down tree transducers
zbMATH Keywords: tree bimorphisms
describes a project that uses: OpenFst
MaRDI profile type: Publication
full work available at URL: s00236-009-0105-8
OpenAlex ID: W307669074
cites work: Syntax directed translations and the pushdown assembler
cites work: OpenFst: A General and Efficient Weighted Finite-State Transducer Library
cites work: Q4138171
cites work: Morphismes et bimorphismes d'arbres
cites work: Composition of top-down and bottom-up tree transductions
cites work: Q3859267
cites work: A comparison of tree transductions defined by monadic second order logic and by attribute grammars
cites work: Attribute grammars and recursive program schemes. I. II
cites work: Bottom-up and top-down tree transformations— a comparison
cites work: Top-down tree transducers with regular look-ahead
cites work: Context-free graph grammars and concatenation of graphs
cites work: Extended Multi Bottom-Up Tree Transducers
cites work: Macro tree transducers, attribute grammars, and MSO definable tree translations.
cites work: Tree transducers, L systems, and two-way machines
cites work: Q3925893
cites work: A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
cites work: Linear deterministic multi bottom-up tree transducers
cites work: Increasing modularity and language-independency in automatically generated compilers
cites work: General varieties of tree languages
cites work: Composition and evaluation of attribute coupled grammars
cites work: Q3862379
cites work: Q4380987
cites work: Compositions of extended top-down tree transducers
cites work: The Power of Extended Top-Down Tree Transducers
cites work: Independent parallelism in finite copying parallel rewriting systems
cites work: Rational tree relations
cites work: Mappings and grammars on trees
cites work: On multiple context-free grammars
cites work: Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms
cites work: Generalized sequential machine maps
DOI: 10.1007/S00236-009-0105-8
description: scientific article; zbMATH DE number 5634766