Caractérisation results about L codes
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 3, pp. 287-301. 
@article{ITA_1992__26_3_287_0,
     author = {Honkala, J. and Salomaa, A.},
     title = {Caract\'erisation results about $L$ codes},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {287--301},
     publisher = {EDP-Sciences},
     volume = {26},
     number = {3},
     year = {1992},
     mrnumber = {1170327},
     zbl = {0751.68033},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1992__26_3_287_0/}
}
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
SP  - 287
EP  - 301
VL  - 26
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1992__26_3_287_0/
LA  - en
ID  - ITA_1992__26_3_287_0
ER  - 
%0 Journal Article
%A Honkala, J.
%A Salomaa, A.
%T Caractérisation results about $L$ codes
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1992
%P 287-301
%V 26
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1992__26_3_287_0/
%G en
%F ITA_1992__26_3_287_0
Honkala, J.; Salomaa, A. Caractérisation results about $L$ codes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 3, pp. 287-301. http://archive.numdam.org/item/ITA_1992__26_3_287_0/

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

2. J. Berstel and D. Perrin, Theory of Codes, Academic Press, New York, 1985. | MR | Zbl

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. | MR | Zbl

5. A. Ehrenfeucht and G. Rozenberg, Simplifications of Homomorphisms, Inform. and Control, 1978, 38, pp. 298-309. | MR | Zbl

6. C. Frougny, Linear Numeration Systems of Order Two, Inform. and Comput., 1988, 77, pp. 233-259. | MR | Zbl

7. J. Honkala, Unique Representation in Number Systems and L Codes, Discrete Appl. Math., 1982, 4, pp. 229-232. | MR | Zbl

8. J. Honkala, Bases and Ambiguity of Number Systems, Theoret. Comput. Sci., 1984, 31, pp. 61-71. | MR | Zbl

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

10. J. Honkala, Regularity Properties of L Ambiguities of Morphisms, "In the Footsteps of L", Springer-Verlag (to appear). | MR

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 | Zbl

12. A. De Luca and A. Restivo, Star-free Sets of Integers, Theoret. Comput. Sci., 1986, 43, pp. 265-275.. | MR | Zbl

13. H. Maurer, A. Salomaa and D. Wood, L Codes and Number Systems, Theoret. Comput. Sci., 1983, 22, pp. 331-346. | MR | Zbl

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 | Zbl

15. A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockville, 1981. | MR | Zbl

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. | MR | Zbl

18. A. Salomaa, Cryptographic properties of L codes, in preparation.