EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 20 / No 3 (1986) RAIRO-Theor. Inf. Appl., 20 3 (1986) 221-250 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 20, Number 3, 1986
Page(s) 221 - 250
DOI https://doi.org/10.1051/ita/1986200302211
Published online 01 February 2017
  1. 1. J. BEAUQUIER, Deux familles de langages incomparables, Inform and Control, vol. 43-2, 1979, p. 101-121. [MR: 553693] [Zbl: 0427.68064] [Google Scholar]
  2. 2. J. BERSTEL, Transductions and context-free languages, Teubner Studien Bucher-Stuttgart, 1979. [MR: 549481] [Zbl: 0424.68040] [Google Scholar]
  3. 3. J. BERSTEL et C. REUTENAUER, Les séries rationnelles et leurs langages, Masson, 1984. [MR: 745968] [Zbl: 0573.68037] [Google Scholar]
  4. 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] [Google Scholar]
  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. [EuDML: 92056] [MR: 483746] [Zbl: 0378.68040] [Google Scholar]
  6. 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] [Google Scholar]
  7. 7. J. ENGELFRIET, Two-Way Automata and Checking Automata, Math-Centrum-Amsterdam, 1981. [MR: 560288] [Zbl: 0423.68035] [Google Scholar]
  8. 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] [Google Scholar]
  9. 9. S. GREIBACH, (1) One Way Finit Visit Automata, T.C.S., 6, 1978, p. 175-221; [MR: 489039] [Zbl: 0368.68059] [Google Scholar]
  10. (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] [Google Scholar]
  11. (3) Syntactic Operators on Full Semi AFLS, J.C.S.S., vol. 6, 1972, p. 30-76; [Zbl: 0269.68046] [MR: 307535] [Google Scholar]
  12. (4) Checking Automata and One-Way Stack-Languages, J.C.S.S., vol. 3, 1963, p. 196-217. [MR: 243953] [Zbl: 0174.02702] [Google Scholar]
  13. 10. S. GREIBACH et J. HOPCROFT, Scattered Context Grammars, J.C.S.S., vol. 3, 1969, p. 233-247. [MR: 246727] [Zbl: 0174.02801] [Google Scholar]
  14. 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] [Google Scholar]
  15. 12. M. HARRISON, Introduction to Formal Language Theory, Addison wesley, 1978. [MR: 526397] [Zbl: 0411.68058] [Google Scholar]
  16. 13. M. LATTEUX, (1) EDTOL, systèmes ultralinéaires et opérateurs associés, T.R. 100, 1977, Université de Lille; [Google Scholar]
  17. (2) Substitutions dans les EDTOL, Inform and control, vol. 42, n° 2, 1979; [Google Scholar]
  18. (3) Sur les générateurs algébriques ultralinéaires, Acta Informatica, vol. 13, 1980, p. 347-363; [Zbl: 0414.68047] [MR: 576588] [Google Scholar]
  19. (4) A propos du lemme de substitution, TCS, vol. 14, 1981, p. 119-123; [MR: 609517] [Zbl: 0454.68086] [Google Scholar]
  20. (5) Langages à un compteur, J.C.S.S., vol. 26, n° 1, février 1983. [Zbl: 0508.68050] [MR: 699217] [Google Scholar]
  21. 14. M. LOTHAIRE, Combinatorics on Words, Addison-Wesley Publ., 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
  22. 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] [Google Scholar]
  23. (2) Some Consequence of a Result of Ehrenfeucht and Rozenberg, R.A.I.R.O., vol. 14, n° 1, 1980, p. 119-122. [MR: 570040] [Zbl: 0429.68066] [Google Scholar]
  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; [EuDML: 92224] [MR: 795773] [Zbl: 0604.68094] [Google Scholar]
  25. (2) Automates boustrophédons et mots infinis, Th. Comput. Sc., vol. 35, 1982, p. 115-122. [MR: 785911] [Zbl: 0571.68074] [Google Scholar]
  26. 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] [Google Scholar]
  27. 18. G. ROZENBERG et A. SALOMAA, The Mathematical Theory of L-Systems, Academic Press, 1980. [MR: 561711] [Zbl: 0508.68031] [Google Scholar]
  28. 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] [Google Scholar]
  29. (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] [Google Scholar]
  30. 20. B. ROZOY, (1) About two-Way Transducers, FCT 85 et T.R. LITP 85-43- Université Paris-VII; [Zbl: 0574.68067] [Google Scholar]
  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. [Google Scholar]
  32. 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] [Google Scholar]
  33. (2) Formal Languages, Academic Press, 1973. [Zbl: 0262.68025] [Google Scholar]
  34. 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] [Google Scholar]
  35. 23. E. WELZ et K. CULIK, Two-Way Finite State Generators (communicated by E. WELZ). [Zbl: 0528.68059] [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.