Free Access
RAIRO-Theor. Inf. Appl.
Volume 20, Number 1, 1986
Page(s) 43 - 46
Published online 01 February 2017
  1. 1. K. CULIK II and T. HARJU, The ω-Sequence Equivalence Problem for DOL Systems is Decidable, J.A.C.M., Vol. 31, 1984, pp. 282-298. [MR: 819139] [Zbl: 0632.68078] [Google Scholar]
  2. 2. K. CULIK II and A. SALOMAA, On Infinite Words Obtained by Iterating Morphisms, Theoretical Computer Science, Vol. 19, 1982, pp. 29-38. [MR: 664411] [Zbl: 0492.68059] [Google Scholar]
  3. 3. T. HEAD, Adherence Equivalence is Decidable for DOL Languages, Proceedings of the Symposium on Theoretical Aspects of Computer Science, Paris, April 1984. Lecture Notes in Computer Science No. 166, pp. 241-249, Springer-Verlag, Berlin, 1984. [MR: 773326] [Zbl: 0543.68060] [Google Scholar]
  4. 4. J. J. PANSIOT, Bornes inférieures sur la complexité des facteurs des mots infinis engendrés par morphismes itérés, Ibid., pp. 230-240. [MR: 773325] [Zbl: 0543.68061] [Google Scholar]
  5. 5. G. ROZENBERG and A. SALOMAA, The Mathematical Theory of L Systems, Academic Press, NewYork, 1980. [MR: 561711] [Zbl: 0508.68031] [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.