A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead

Authors:
Zoltán Fülöp;Armin Kühnemann;Heiko Vogler
Affiliations:
Department of Computer Science, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary;Faculty of Computer Science, Technical University of Dresden, D-01062 Dresden, Germany;Faculty of Computer Science, Technical University of Dresden, D-01062 Dresden, Germany
Venue:
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Year:
2004

Linear deterministic multi bottom-up tree transducers

Theoretical Computer Science
Compositions of extended top-down tree transducers

Information and Computation
Extended Multi Bottom-Up Tree Transducers

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Compositions of top-down tree transducers with ε-rules

FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Tree transformations and dependencies

MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation

Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Second position clitics and monadic second-order transduction

ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing

Hi-index	0.01