EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 26 / No 3 (1992) RAIRO-Theor. Inf. Appl., 26 3 (1992) 287-301 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 26, Number 3, 1992
Page(s) 287 - 301
DOI https://doi.org/10.1051/ita/1992260302871
Published online 01 February 2017
  1. 1. J. BERSTEL, Fibonacci Words - A Survey. In G. ROZENBERG and A. SALOMAA Ed. The Book of L, Springer-Verlag, Berlin, Heidelberg, New York, 1986, pp. 13-27. [Zbl: 0589.68053] [Google Scholar]
  2. 2. J. BERSTEL and D. PERRIN, Theory of Codes, Academic Press, New York, 1985. [MR: 797069] [Zbl: 0587.68066] [Google Scholar]
  3. 3. V. BRUYERE, Codes préfixes. Codes a delai de déchiffrage borne. Nouvelle thèse, Université de Mons, 1989. [Google Scholar]
  4. 4. K. CULIK II and A. SALOMAA, Ambiguity and Decision Problems Conceming Nurnber Systems, Inform. and Control, 1983, 56, pp. 139-153. [MR: 735500] [Zbl: 0541.03006] [Google Scholar]
  5. 5. A. EHRENFEUCHT and G. ROZENBERG, Simplifications of Homomorphisms, Inform. and Control, 1978, 38, pp. 298-309. [MR: 509555] [Zbl: 0387.68062] [Google Scholar]
  6. 6. C. FROUGNY, Linear Numeration Systems of Order Two, Inform. and Comput., 1988, 77, pp. 233-259. [MR: 942576] [Zbl: 0648.68066] [Google Scholar]
  7. 7. J. HONKALA, Unique Representation in Number Systems and L Codes, Discrete Appl. Math., 1982, 4, pp. 229-232. [MR: 675853] [Zbl: 0537.94024] [Google Scholar]
  8. 8. J. HONKALA, Bases and Ambiguity of Number Systems, Theoret. Comput. Sci., 1984, 31, pp. 61-71. [MR: 752094] [Zbl: 0546.68066] [Google Scholar]
  9. 9. J. HONKALA, It is Decidable Whether or Not a Permutation-Free Morphism is an L Code, Int. J. Comput. Math., 1987, 22, pp. 1-11. [Zbl: 0684.68091] [Google Scholar]
  10. 10. J. HONKALA, Regularity Properties of L Ambiguities of Morphisms, "In the Footsteps of L", Springer-Verlag (to appear). [Zbl: 0766.68079] [MR: 1226684] [Google Scholar]
  11. 11. J. HONKALA and A. SALOMAA, L-Morphisms: Bounded Delay and Regularity of Ambiguity, Springer Lecture Notes in Comput. Sci., 1991, 510, pp. 566-574. [MR: 1129936] [Zbl: 0766.68078] [Google Scholar]
  12. 12. A. DE LUCA and A. RESTIVO, Star-free Sets of Integers, Theoret. Comput. Sci., 1986, 43, pp. 265-275.. [MR: 855976] [Zbl: 0597.68060] [Google Scholar]
  13. 13. H. MAURER, A. SALOMAA and D. WOOD, L Codes and Number Systems, Theoret. Comput. Sci., 1983, 22, pp. 331-346. [MR: 693064] [Zbl: 0531.68027] [Google Scholar]
  14. 14. H. MAURER, A. SALOMAA and D. WOOD, Bounded delay L codes, IIG Technical Report 1990, Theoret. Comput. Sci., 1991, 84, pp. 265-279. [MR: 1118124] [Zbl: 0735.68051] [Google Scholar]
  15. 15. A. SALOMAA, Jewels of Formal Language Theory, Computer Science Press, Rockville, 1981. [MR: 618124] [Zbl: 0487.68064] [Google Scholar]
  16. 16. A. SALOMAA, L codes: variations on a theme by MSW. In Ten Years IIG, IIG Report, 1988, 260, p. 218. [Google Scholar]
  17. 17. A. SALOMAA, Public-Key Cryptography, Springer-Verlag, Berlin, Heidelberg, New York, 1990. [MR: 1081541] [Zbl: 0712.68003] [Google Scholar]
  18. 18. A. SALOMAA, Cryptographic properties of L codes, in preparation. [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.