Defining syntax-directed translations by tree bimorphisms

Authors:
Magnus Steinby;Ctlin Ionu Tîrnuc
Affiliations:
Department of Mathematics, University of Turku, FIN-20014 Turku, Finland;Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, Tarragona 43005, Spain
Venue:
Theoretical Computer Science
Year:
2009

Citing 13
Cited 2

Alphabetic tree relations

Theoretical Computer Science
Tree languages

Handbook of formal languages, vol. 3
A syntax directed compiler for ALGOL 60

Communications of the ACM
Rational relations of Binary Trees

Proceedings of the Fourth Colloquium on Automata, Languages and Programming
The mathematics of statistical machine translation: parameter estimation

Computational Linguistics - Special issue on using large corpora: II
Finite-state transducers in language and speech processing

Computational Linguistics
Stochastic inversion transduction grammars and bilingual parsing of parallel corpora

Computational Linguistics
Multitext Grammars and synchronous parsers

NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Capturing practical natural language transformations

Machine Translation
Compositions of extended top-down tree transducers

Information and Computation
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences
Tree acceptors and some of their applications

Journal of Computer and System Sciences
Generalized2 sequential machine maps

Journal of Computer and System Sciences

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms -- Revisited

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Equational tree transformations

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these ''quasi-alphabetic'' tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses.