Extended Multi Bottom-Up Tree Transducers

Authors:
Joost Engelfriet;Eric Lilin;Andreas Maletti
Affiliations:
Leiden Institute of Advanced Computer Science, Leiden University, Leiden, The Netherlands 2300 RA;Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France UFR IEEA 59655;International Computer Science Institute, Berkeley, USA CA 94704
Venue:
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Year:
2008

Citing 15
Cited 2

Composition and evaluation of attribute coupled grammars

Acta Informatica
Tree languages

Handbook of formal languages, vol. 3
Macro tree transducers, attribute grammars, and MSO definable tree translations

Information and Computation
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Benefits of Tree Transducers for Optimizing Functional Programs

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Mathematical and computational aspects of lexicalized grammars

Mathematical and computational aspects of lexicalized grammars
Synchronous tree-adjoining grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Linear deterministic multi bottom-up tree transducers

Theoretical Computer Science
Compositions of extended top-down tree transducers

Information and Computation
Syntax directed translations and the pushdown assembler

Journal of Computer and System Sciences
Generalized2 sequential machine maps

Journal of Computer and System Sciences
Syntax-directed translations and quasi-alphabetic tree bimorphisms

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
An overview of probabilistic tree transducers for natural language processing

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing

Compositions of top-down tree transducers with ε-rules

FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Survey: weighted extended top-down tree transducers part iii - composition

Algebraic Foundations in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extended multi bottom-up tree transducers are defined and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute any transformation that is computed by a linear extended top-down tree transducer. Moreover, the classical composition results for bottom-up tree transducers are generalized to extended multi bottom-up tree transducers. Finally, a characterization in terms of extended top-down tree transducers is presented.