| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437733 | Theoretical Computer Science | 2009 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
