Geodesic
Transductions de forêts reconnaissables monadiques, forêts corégulières
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 10 (1976) no. R1, pp. 5-28.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1976__10_1_5_0,
     author = {Arnold, Andr\'e and Dauchet, Max},
     title = {Transductions de for\^ets reconnaissables monadiques, for\^ets cor\'eguli\`eres},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {5--28},
     publisher = {Dunod-Gauthier-Villars},
     address = {Paris},
     volume = {10},
     number = {R1},
     year = {1976},
     mrnumber = {416121},
     language = {fr},
     url = {http://geodesic.mathdoc.fr/item/ITA_1976__10_1_5_0/}
}
TY  - JOUR
AU  - Arnold, André
AU  - Dauchet, Max
TI  - Transductions de forêts reconnaissables monadiques, forêts corégulières
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1976
SP  - 5
EP  - 28
VL  - 10
IS  - R1
PB  - Dunod-Gauthier-Villars
PP  - Paris
UR  - http://geodesic.mathdoc.fr/item/ITA_1976__10_1_5_0/
LA  - fr
ID  - ITA_1976__10_1_5_0
ER  - 
%0 Journal Article
%A Arnold, André
%A Dauchet, Max
%T Transductions de forêts reconnaissables monadiques, forêts corégulières
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1976
%P 5-28
%V 10
%N R1
%I Dunod-Gauthier-Villars
%C Paris
%U http://geodesic.mathdoc.fr/item/ITA_1976__10_1_5_0/
%G fr
%F ITA_1976__10_1_5_0
Arnold, André; Dauchet, Max. Transductions de forêts reconnaissables monadiques, forêts corégulières. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 10 (1976) no. R1, pp. 5-28. http://geodesic.mathdoc.fr/item/ITA_1976__10_1_5_0/

[1] Baker B. S., Tree transductions and families of tree languages. 5th ACM Symposium on theory of Computing (1973). | Zbl | MR

[2] Brainerd W. S., Tree-generating regular System. Information and Control, 14 (1969), 218-231. | Zbl | MR

[3] Downey P., Formal languages and recursion schemas, ph. D. dissertation Harvard University (1974).

[4] Downey P., Tree transducers and ETOL Tree Systems. Conference on formal languages, automata and development. Noordwijkerhout, The Netherlands (avril 1975).

[5] Herman G. T. et Rozenberg G., Developmental Systems and Languages. North-Holland P. C. (1975). | Zbl | MR

[6] Latteux M., Langages simultanés. Publication du laboratoire de calcul de Lille, n° 46 (1974).

[7] Luckham D. C., Park D. M. et Paterson M. S. On formalized computer programs. J. Comput. System Sci., 4 (1970), 220-249. | Zbl | MR

[8] Mezei J. et Wright J. B., Algebraic automata and context-free sets. Math Systems Theory, 4 (1970), 257-287.

[9] Rounds W. C., Mappings and grammars on trees. Math Systems Theory, 4 (1970), 257-287. | Zbl | MR

[10] Rozenberg G., Extensions of tabled OL-Systems and Languages. Internat. J. Comput. Information Sci, 2 (1973), 311-336. | Zbl | MR

[11] Thatcher J. W., Generalized2 sequential machine maps. J. Comput. System Sci., 4 (1970), 339-367. | Zbl | MR