Syntax-directed translations and quasi-alphabetic tree bimorphisms

Authors:
Magnus Steinby;Cătălin Ionuţ Tîrnăucă
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland;Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain
Venue:
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Year:
2007

Citing 7
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
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

Extended Multi Bottom-Up Tree Transducers

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Equational tree transformations

Theoretical Computer Science

Quantified Score

Hi-index	0.00

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.