Free Access
Issue
RAIRO. Inform. théor.
Volume 16, Number 3, 1982
Page(s) 191 - 199
DOI https://doi.org/10.1051/ita/1982160301911
Published online 01 February 2017
  1. 1. J. M. AUTEBERT, J. BEAUQUIER, L. BOASSON and M. NIVAT, Quelques problèmes ouverts en théorie des langages algébriques, R.A.I.R.O. Informatique Théorique, Vol. 13,(4), 1979, pp. 363-378. [EuDML: 92110] [MR: 556958] [Zbl: 0434.68056] [Google Scholar]
  2. 2. D. R. BEAN, A. EHRENFEUCHT and G. F. MCNULTY, Avoidable Patierns in Strings of Symbols, Pacific Journal of Mathematics, Vol. 85, (2), 1979, pp. 261-294. [MR: 574919] [Zbl: 0428.05001] [Google Scholar]
  3. 3. J. BERSTEL, Sur les mots sans carré définis par un morphisme, A. MAURER, Ed., Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 71, Springer-Verlag, 1979, pp. 16-25. [MR: 573232] [Zbl: 0425.20046] [Google Scholar]
  4. 4. C. H. BRAUNHOLTZ, Solution to Problem 5030, American Math. Monthly, Vol. 70, 1963, pp. 675-676. [MR: 1532217] [Google Scholar]
  5. 5. S. A. GREIBACH, Eraseable Context-Free Languages, Information and Control, Vol. 4, 1975, pp. 301-306. [MR: 386358] [Zbl: 0317.68059] [Google Scholar]
  6. 6. M. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, 1978. [MR: 526397] [Zbl: 0411.68058] [Google Scholar]
  7. 7. G. A. HEDLUND, Remarks on the Work of Axel Thue on Sequences, Nordisk Matematisk Tidskrift, Vol. 15, 1967, pp. 148-150. [MR: 228875] [Zbl: 0153.33101] [Google Scholar]
  8. 8. J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979. [MR: 645539] [Zbl: 0426.68001] [Google Scholar]
  9. 9. G. HOTZ and R. ROSS, LL (k)-and LR (k)-Invarianz von Kontextfreien Grammatike unter einer Transformation auf Greibach-Normalform, Elektronische Informationsverarbeitung und Kybernetik, Vol. 15, (1/2), 1979, pp. 73-86. [MR: 542003] [Zbl: 0426.68065] [Google Scholar]
  10. 10. P. A. B. PLEASANTS, Nonrepetitive Sequence, Proc. Cambridge Philosophical Society, Vol. 68, 1970, pp. 267-274. [Zbl: 0237.05010] [Google Scholar]
  11. 11. R. ROSS Grammar Transformations Based on Regular Decompositions of Context-Free Derivations, Dissertation, Computer Science Department, Washington State University, Pullman, WA. 1978. [Google Scholar]
  12. 12. R. ROSS, G. HOTZ and D. BENSON, A General Greibach-Normal-Form transformation, Technical Report CS-78-048, Computer Science Department, Washington State University, Pullman, WA. 1978. [Google Scholar]
  13. 13. A. THUE, Über Unendliche Zeichenreih, Norske Videnskabers Selskabs Skrifter Mat.-Nat. K1. (Kristiania), Nr. 7, 1906, S. 1-22. [JFM: 39.0283.01] [Google Scholar]
  14. 14. A. THUE, Über die Gegenseitige Lage Gleicher Teile Gewisser Zeichenre, Norske Videnskabers Selskabs Skrifter Mat.-Nat. Kl. (Kristiania), Nr. 1, 1912, S. 1-67. [JFM: 44.0462.01] [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.