Free Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 28, Number 5, 1994
|
|
|---|---|---|
| Page(s) | 447 - 463 | |
| DOI | https://doi.org/10.1051/ita/1994280504471 | |
| Published online | 01 February 2017 | |
- 1. L. BOASSON and J.-M. AUTEBERT, Transductions rationnelles. Applications aux langages algébriques, Masson, Collection ERI, 1988. [MR: 969364] [Zbl: 0758.68041] [Google Scholar]
- 2. A. ARNOLD and M. DAUCHET, Morphismes et bimorphismes d'arbres, Theoretical Computer Sciences, 1982, 20, pp. 33-93. [MR: 652427] [Zbl: 0486.68072] [Google Scholar]
- 3. J. BERSTEL, Transductions and context-free languages, Teubner Verlag Stuttgart, 1979. [MR: 549481] [Zbl: 0424.68040] [Google Scholar]
- 4. S. BOZAPALIDIS, Alphabetic tree relations, TCS 99. 1992, p. 177-211. [MR: 1168459] [Zbl: 0765.68068] [Google Scholar]
- 5. M. DAUCHET and S. TISON, The theory of ground rewrite Systems is decidable, Proceedings of 5th IEEE Symposium on Logic in Computer Sciences, Philadelphia, June 4-7, 1990, pp. 242-248. [MR: 1099177] [Google Scholar]
- 6. J. DONER, Tree acceptors and some of their applications, Journal of Computer and System Sciences, 1970, 4, pp. 406-451. [MR: 287977] [Zbl: 0212.02901] [Google Scholar]
- 7. J. ENGELFRIET, Bottom-up and top-down tree transformations: a comparison, Mathematical system theory, 1975, 9, pp. 198-231. [MR: 398700] [Zbl: 0335.68061] [Google Scholar]
- 8. J. ENGELFRIET, Top-down tree transducers with regular look-ahead, Mathematical System Theory, 1977, 10, pp. 289-303. [MR: 489019] [Zbl: 0369.68048] [Google Scholar]
- 9. J. ENGELFRIET, A hierarchy of tree transucers, Proc. 3e colloque sur les Arbres en Algèbre et en Programmation, Université de Lille I, 1978. [MR: 505844] [Zbl: 0386.68070] [Google Scholar]
- 10. J. ENGELFRIET, Some open questions and recent results on tree transducers and tree languages, Formal language theory, Academic press, 1980, pp. 241-286. [Google Scholar]
- 11. Z. ESIK, Decidability results concerning tree transducers I, Acta Cybernetica, 1980, Tome 5, Fasc. 1, pp. 1-20, Szeged. [MR: 599040] [Zbl: 0456.68098] [Google Scholar]
- 12. C. FROUGNY and J. SAKAROVITCH, Relations rationnelles à délai borné. Actes des Journées Montoises, 49-52, Université de Mons-Hainaut, Belgique, 1990, Proceedings of International Colloquium on Words, Languages and Combinatorics, Kyoto, 1990. [Google Scholar]
- 13. F. GECSEG and M. STEINBY, Tree automata, Akademiai Kiado, Budapest, 1984. [MR: 735615] [Zbl: 0537.68056] [Google Scholar]
- 14. M. O. RABIN, Decidability of second-order theories and automata on infinite trees, 1969, 141, Trans. Amer. Math. Soc., pp. 1-35. [MR: 246760] [Zbl: 0221.02031] [Google Scholar]
- 15. W. C. ROUNDS, Trees, transducers and transformations, Ph. D. Dissertation, Stanford University, 1968. [MR: 2617844] [Google Scholar]
- 16. H. SEIDL, Equivalence of finite-valued bottom-up finite state tree transducers is decidable, Universität des Saarlandes, Saarbrücken, Germany, Proceeding of CAAP 90, pp. 269-284. [MR: 1075033] [Zbl: 0758.68049] [Google Scholar]
- 17. J. W. THATCHER, Generalized2 sequential machines, Journal of Computer and System Sciences, 1970, 4, pp. 339-367. [Zbl: 0198.03303] [Google Scholar]
- 18. S. TISON, Automates comme outil de décision dans les arbres, Dossier d'habilitation à diriger des recherches, Lille, 1990. [Google Scholar]
- 19. Z. ZACHAR, The solvability of the equivalence problem for deterministic frontier-to-root tree transducers, Acta Cybernetica, 1978, v.4., pp. 167-177. [MR: 525042] [Zbl: 0401.68058] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.