Caractérisation results about codes
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1992)
- Volume: 26, Issue: 3, page 287-301
- ISSN: 0988-3754
Access Full Article
top
How to cite
topHonkala, J., and Salomaa, A.. "Caractérisation results about $L$ codes." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 26.3 (1992): 287-301. <http://eudml.org/doc/92419>.
@article{Honkala1992,
author = {Honkala, J., Salomaa, A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = { codes of bounded delay},
language = {eng},
number = {3},
pages = {287-301},
publisher = {EDP-Sciences},
title = {Caractérisation results about $L$ codes},
url = {http://eudml.org/doc/92419},
volume = {26},
year = {1992},
}
TY - JOUR
AU - Honkala, J.
AU - Salomaa, A.
TI - Caractérisation results about $L$ codes
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1992
PB - EDP-Sciences
VL - 26
IS - 3
SP - 287
EP - 301
LA - eng
KW - codes of bounded delay
UR - http://eudml.org/doc/92419
ER -
References
top- 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. Zbl0589.68053
- 2. J. BERSTEL and D. PERRIN, Theory of Codes, Academic Press, New York, 1985. Zbl0587.68066MR797069
- 3. V. BRUYERE, Codes préfixes. Codes a delai de déchiffrage borne. Nouvelle thèse, Université de Mons, 1989.
- 4. K. CULIK II and A. SALOMAA, Ambiguity and Decision Problems Conceming Nurnber Systems, Inform. and Control, 1983, 56, pp. 139-153. Zbl0541.03006MR735500
- 5. A. EHRENFEUCHT and G. ROZENBERG, Simplifications of Homomorphisms, Inform. and Control, 1978, 38, pp. 298-309. Zbl0387.68062MR509555
- 6. C. FROUGNY, Linear Numeration Systems of Order Two, Inform. and Comput., 1988, 77, pp. 233-259. Zbl0648.68066MR942576
- 7. J. HONKALA, Unique Representation in Number Systems and L Codes, Discrete Appl. Math., 1982, 4, pp. 229-232. Zbl0537.94024MR675853
- 8. J. HONKALA, Bases and Ambiguity of Number Systems, Theoret. Comput. Sci., 1984, 31, pp. 61-71. Zbl0546.68066MR752094
- 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. Zbl0684.68091
- 10. J. HONKALA, Regularity Properties of L Ambiguities of Morphisms, "In the Footsteps of L", Springer-Verlag (to appear). Zbl0766.68079MR1226684
- 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. Zbl0766.68078MR1129936
- 12. A. DE LUCA and A. RESTIVO, Star-free Sets of Integers, Theoret. Comput. Sci., 1986, 43, pp. 265-275.. Zbl0597.68060MR855976
- 13. H. MAURER, A. SALOMAA and D. WOOD, L Codes and Number Systems, Theoret. Comput. Sci., 1983, 22, pp. 331-346. Zbl0531.68027MR693064
- 14. H. MAURER, A. SALOMAA and D. WOOD, Bounded delay L codes, IIG Technical Report 1990, Theoret. Comput. Sci., 1991, 84, pp. 265-279. Zbl0735.68051MR1118124
- 15. A. SALOMAA, Jewels of Formal Language Theory, Computer Science Press, Rockville, 1981. Zbl0487.68064MR618124
- 16. A. SALOMAA, L codes: variations on a theme by MSW. In Ten Years IIG, IIG Report, 1988, 260, p. 218.
- 17. A. SALOMAA, Public-Key Cryptography, Springer-Verlag, Berlin, Heidelberg, New York, 1990. Zbl0712.68003MR1081541
- 18. A. SALOMAA, Cryptographic properties of L codes, in preparation.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.