Outils et résultats pour les transducteurs boustrophédons
Rozoy, Brigitte
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986), p. 221-250 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1986-01-01
@article{ITA_1986__20_3_221_0,
     author = {Rozoy, Brigitte},
     title = {Outils et r\'esultats pour les transducteurs boustroph\'edons},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {20},
     year = {1986},
     pages = {221-250},
     mrnumber = {894713},
     zbl = {0617.68073},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1986__20_3_221_0}
}

Rozoy, Brigitte. Outils et résultats pour les transducteurs boustrophédons. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) pp. 221-250. http://gdmltest.u-ga.fr/item/ITA_1986__20_3_221_0/

1. J. Beauquier, Deux familles de langages incomparables, Inform and Control, vol. 43-2, 1979, p. 101-121. | MR 553693 | Zbl 0427.68064

2. J. Berstel, Transductions and context-free languages, Teubner Studien Bucher-Stuttgart, 1979. | MR 549481 | Zbl 0424.68040

3. J. Berstel et C. Reutenauer, Les séries rationnelles et leurs langages, Masson, 1984. | MR 745968 | Zbl 0573.68037

4. B. Brainerd, An Analog of a Theorem about Context-Free Languages, Inform and control, Vol. 11, 1968, p. 561-567. | MR 229488 | Zbl 0184.02601

5. A. Ehrenfeucht et G. Rozenberg, On Some Context-Free Languages that Are Not Deterministic EDTOL Languages, R.A.I.R.O. - Info. Théorique, vol. 11, n° 4, 1977, p. 273-191. | Numdam | MR 483746 | Zbl 0378.68040

6. R. Ehrich et S. Yau, Two-Way Sequential Transductions and Stacks Automata, Inform and control, vol. 18, 1971, p. 404-446. | MR 311427 | Zbl 0222.94063

7. J. Engelfriet, Two-Way Automata and Checking Automata, Math-Centrum-Amsterdam, 1981. | MR 560288 | Zbl 0423.68035

8. D. Ferment, Principality Results About Some Matrix Languages Families, Lecture note in computer Science, 172, I.C.A.L.P., juillet 1984. | MR 784245 | Zbl 0551.68063

9. S. Greibach, (1) One Way Finit Visit Automata, T.C.S., 6, 1978, p. 175-221; | MR 489039 | Zbl 0368.68059

(2) Remarks on Blind and Partially Blind One-Way Multicounter Machines, Th. computer science, vol. 7, 1978, p. 311-324; | MR 513714 | Zbl 0389.68030

(3) Syntactic Operators on Full Semi AFLS, J.C.S.S., vol. 6, 1972, p. 30-76; | MR 307535

(4) Checking Automata and One-Way Stack-Languages, J.C.S.S., vol. 3, 1963, p. 196-217. | MR 243953 | Zbl 0174.02702

10. S. Greibach et J. Hopcroft, Scattered Context Grammars, J.C.S.S., vol. 3, 1969, p. 233-247. | MR 246727 | Zbl 0174.02801

11. O. Ibarra, On Two-Way Sequential Transductions of Full Semi-AFL'S, T.C.S., vol. 7, 1978, p. 287-309. | MR 521206 | Zbl 0387.68047

12. M. Harrison, Introduction to Formal Language Theory, Addison wesley, 1978. | MR 526397 | Zbl 0411.68058

13. M. Latteux, (1) EDTOL, systèmes ultralinéaires et opérateurs associés, T.R. 100, 1977, Université de Lille;

(2) Substitutions dans les EDTOL, Inform and control, vol. 42, n° 2, 1979;

(3) Sur les générateurs algébriques ultralinéaires, Acta Informatica, vol. 13, 1980, p. 347-363; | MR 576588

(4) A propos du lemme de substitution, TCS, vol. 14, 1981, p. 119-123; | MR 609517 | Zbl 0454.68086

(5) Langages à un compteur, J.C.S.S., vol. 26, n° 1, février 1983. | MR 699217

14. M. Lothaire, Combinatorics on Words, Addison-Wesley Publ., 1983. | MR 675953 | Zbl 0514.20045

15. G. Paun, (1) On the Index of Grammars and Languages, Inform and control, vol. 35, 1977, p. 259-266; | MR 468357 | Zbl 0363.68107

(2) Some Consequence of a Result of Ehrenfeucht and Rozenberg, R.A.I.R.O., vol. 14, n° 1, 1980, p. 119-122. | Numdam | MR 570040 | Zbl 0429.68066

16. J. Pecuchet, (1) Automates boustrophédons, semi-groupes de Birget et monoïde inversif libre, R.A.I.R.O.-Informatique théorique, vol. 19, n° 1, 1985, p. 71-100; | Numdam | MR 795773 | Zbl 0604.68094

(2) Automates boustrophédons et mots infinis, Th. Comput. Sc., vol. 35, 1982, p. 115-122. | MR 785911 | Zbl 0571.68074

17. V. Rajlich, Absolutely parallel grammars and two-way finite state transducers, J.C.S.S., vol. 6, 1972, p. 324-342. | MR 300833 | Zbl 0246.68013

18. G. Rozenberg et A. Salomaa, The Mathematical Theory of L-Systems, Academic Press, 1980. | MR 561711 | Zbl 0508.68031

19. G. Rozenberg et D. Vermeir, (1) On ETOL System of Finite Index, Inform and control, vol. 38, 1978, p. 103-133; | MR 489057 | Zbl 0384.68072

(2) On the Effect of the Finite Index Restriction on Several Families of Grammars, Inform and control, vol. 39, 1978, p. 284-302. | MR 523443 | Zbl 0387.68061

20. B. Rozoy, (1) About two-Way Transducers, FCT 85 et T.R. LITP 85-43- Université Paris-VII;

(2) The Dyck Language D'1* Is Not Generated by Any Matrix Grammar of Funite Index, T.R. L.I.T.P. 85, Université Paris-VII. To appear in Inform and Control.

21. A. Salomaa, (1) On the Index of Context Free Grammars and Languages, Inform and control, vol. 14, 1969, p. 474-477; | MR 243958 | Zbl 0181.31001

(2) Formal Languages, Academic Press, 1973.

22. M. P. Schutzenberger, On a Special Case of Regular Events, Annals of Math. Stat., vol. 32, 1961, p. 1201-1213. | MR 133894 | Zbl 0243.60049

23. E. Welz et K. Culik, Two-Way Finite State Generators (communicated by E. WELZ). | Zbl 0528.68059