Table of Contents
Journal of Discrete Mathematics
Volume 2013, Article ID 219291, 8 pages
http://dx.doi.org/10.1155/2013/219291
Research Article

Equivalence of Right Infinite Words

University of Latvia, 8 Zellu street, Riga LV-1002, Latvia

Received 31 October 2012; Accepted 18 February 2013

Academic Editor: Zhan Zhou

Copyright © 2013 Liga Kulesa. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Cobham, “Uniform tag sequences,” Mathematical Systems Theory, vol. 6, pp. 164–192, 1972. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. F. M. Dekking, “Iteration of maps by an automaton,” Discrete Mathematics, vol. 126, no. 1–3, pp. 81–86, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. A. Belovs, “Some Algebraic Properties of Machine Poset of Infinite Words,” RAIRO—Theoretical Informatics and Aplications, vol. 42, no. 3, pp. 451–466, 2008. View at Google Scholar
  4. A. A. Muchnik, Y. L. Pritykin, and A. L. Semenov, “Sequences close to periodic,” Uspekhi Matematicheskikh Nauk, vol. 64, no. 5, article 805, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  5. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge University Press, New York, NY, USA, 2002. View at MathSciNet
  6. M. Lothaire, Algebraic Combinatorics on Words, vol. 90 of Encyclopedia of Mathematics and Its Applications, Cambridge University Press, New York, NY, USA, 2002. View at MathSciNet