Skip to main content
Conference Proceedings

Syntax-directed translations and quasi-alphabetic tree bimorphisms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4783 LNCS 265-276
DOI: 10.1007/978-3-540-76336-9_25
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Steinby, M., & Tîrnǎucǎ, C. I. (2007). Syntax-directed translations and quasi-alphabetic tree bimorphisms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4783 LNCS, pp. 265–276). Springer Verlag. https://doi.org/10.1007/978-3-540-76336-9_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free