Outils et résultats pour les transducteurs boustrophédons

Brigitte Rozoy

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1986)

  • Volume: 20, Issue: 3, page 221-250
  • ISSN: 0988-3754

How to cite

top

Rozoy, Brigitte. "Outils et résultats pour les transducteurs boustrophédons." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 20.3 (1986): 221-250. <http://eudml.org/doc/92258>.

@article{Rozoy1986,
author = {Rozoy, Brigitte},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {two-way transducers; iteration; Dyck language},
language = {fre},
number = {3},
pages = {221-250},
publisher = {EDP-Sciences},
title = {Outils et résultats pour les transducteurs boustrophédons},
url = {http://eudml.org/doc/92258},
volume = {20},
year = {1986},
}

TY - JOUR
AU - Rozoy, Brigitte
TI - Outils et résultats pour les transducteurs boustrophédons
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1986
PB - EDP-Sciences
VL - 20
IS - 3
SP - 221
EP - 250
LA - fre
KW - two-way transducers; iteration; Dyck language
UR - http://eudml.org/doc/92258
ER -

References

top
  1. 1. J. BEAUQUIER, Deux familles de langages incomparables, Inform and Control, vol. 43-2, 1979, p. 101-121. Zbl0427.68064MR553693
  2. 2. J. BERSTEL, Transductions and context-free languages, Teubner Studien Bucher-Stuttgart, 1979. Zbl0424.68040MR549481
  3. 3. J. BERSTEL et C. REUTENAUER, Les séries rationnelles et leurs langages, Masson, 1984. Zbl0573.68037MR745968
  4. 4. B. BRAINERD, An Analog of a Theorem about Context-Free Languages, Inform and control, Vol. 11, 1968, p. 561-567. Zbl0184.02601MR229488
  5. 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. Zbl0378.68040MR483746
  6. 6. R. EHRICH et S. YAU, Two-Way Sequential Transductions and Stacks Automata, Inform and control, vol. 18, 1971, p. 404-446. Zbl0222.94063MR311427
  7. 7. J. ENGELFRIET, Two-Way Automata and Checking Automata, Math-Centrum-Amsterdam, 1981. Zbl0423.68035MR560288
  8. 8. D. FERMENT, Principality Results About Some Matrix Languages Families, Lecture note in computer Science, 172, I.C.A.L.P., juillet 1984. Zbl0551.68063MR784245
  9. 9. S. GREIBACH, (1) One Way Finit Visit Automata, T.C.S., 6, 1978, p. 175-221; Zbl0368.68059MR489039
  10. (2) Remarks on Blind and Partially Blind One-Way Multicounter Machines, Th. computer science, vol. 7, 1978, p. 311-324; Zbl0389.68030MR513714
  11. (3) Syntactic Operators on Full Semi AFLS, J.C.S.S., vol. 6, 1972, p. 30-76; Zbl0269.68046MR307535
  12. (4) Checking Automata and One-Way Stack-Languages, J.C.S.S., vol. 3, 1963, p. 196-217. Zbl0174.02702MR243953
  13. 10. S. GREIBACH et J. HOPCROFT, Scattered Context Grammars, J.C.S.S., vol. 3, 1969, p. 233-247. Zbl0174.02801MR246727
  14. 11. O. IBARRA, On Two-Way Sequential Transductions of Full Semi-AFL'S, T.C.S., vol. 7, 1978, p. 287-309. Zbl0387.68047MR521206
  15. 12. M. HARRISON, Introduction to Formal Language Theory, Addison wesley, 1978. Zbl0411.68058MR526397
  16. 13. M. LATTEUX, (1) EDTOL, systèmes ultralinéaires et opérateurs associés, T.R. 100, 1977, Université de Lille; 
  17. (2) Substitutions dans les EDTOL, Inform and control, vol. 42, n° 2, 1979; 
  18. (3) Sur les générateurs algébriques ultralinéaires, Acta Informatica, vol. 13, 1980, p. 347-363; Zbl0414.68047MR576588
  19. (4) A propos du lemme de substitution, TCS, vol. 14, 1981, p. 119-123; Zbl0454.68086MR609517
  20. (5) Langages à un compteur, J.C.S.S., vol. 26, n° 1, février 1983. Zbl0508.68050MR699217
  21. 14. M. LOTHAIRE, Combinatorics on Words, Addison-Wesley Publ., 1983. Zbl0514.20045MR675953
  22. 15. G. PAUN, (1) On the Index of Grammars and Languages, Inform and control, vol. 35, 1977, p. 259-266; Zbl0363.68107MR468357
  23. (2) Some Consequence of a Result of Ehrenfeucht and Rozenberg, R.A.I.R.O., vol. 14, n° 1, 1980, p. 119-122. Zbl0429.68066MR570040
  24. 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; Zbl0604.68094MR795773
  25. (2) Automates boustrophédons et mots infinis, Th. Comput. Sc., vol. 35, 1982, p. 115-122. Zbl0571.68074MR785911
  26. 17. V. RAJLICH, Absolutely parallel grammars and two-way finite state transducers, J.C.S.S., vol. 6, 1972, p. 324-342. Zbl0246.68013MR300833
  27. 18. G. ROZENBERG et A. SALOMAA, The Mathematical Theory of L-Systems, Academic Press, 1980. Zbl0508.68031MR561711
  28. 19. G. ROZENBERG et D. VERMEIR, (1) On ETOL System of Finite Index, Inform and control, vol. 38, 1978, p. 103-133; Zbl0384.68072MR489057
  29. (2) On the Effect of the Finite Index Restriction on Several Families of Grammars, Inform and control, vol. 39, 1978, p. 284-302. Zbl0387.68061MR523443
  30. 20. B. ROZOY, (1) About two-Way Transducers, FCT 85 et T.R. LITP 85-43- Université Paris-VII; Zbl0574.68067
  31. (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. 
  32. 21. A. SALOMAA, (1) On the Index of Context Free Grammars and Languages, Inform and control, vol. 14, 1969, p. 474-477; Zbl0181.31001MR243958
  33. (2) Formal Languages, Academic Press, 1973. Zbl0262.68025
  34. 22. M. P. SCHUTZENBERGER, On a Special Case of Regular Events, Annals of Math. Stat., vol. 32, 1961, p. 1201-1213. Zbl0243.60049MR133894
  35. 23. E. WELZ et K. CULIK, Two-Way Finite State Generators (communicated by E. WELZ). Zbl0528.68059

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.