Marie-Pierre Béal, Fabio Burderi & Antonio Restivo (2009):
Coding partitions of regular sets.
Inter. Jour. Alg. Comput. Vol 19, No 8(8),
pp. 1011–1023,
doi:10.1142/S0218196709005457.
Jean Berstel, Dominique Perrin & Christophe Reutenauer (2010):
Codes and Automata.
Encyclopedia of Mathematics and its Applications 129.
Cambridge University Press.
Fabio Burderi & Antonio Restivo (2007):
Coding partitions.
Discret. Math. Theor. Comput. Sci. Vol 9, No 2(2),
pp. 227–240.
Fabio Burderi & Antonio Restivo (2007):
Varieties of Codes and Kraft Inequality.
Theory Comput. Systems Vol 40,
pp. 507–520,
doi:10.1007/s00224-006-1320-0.
M. Dalai & R. Leonardi (2005):
Non prefix-free codes for constrained sequences.
In: International Symposium on Information Theory, 2005. ISIT 2005.
IEEE,
pp. 1534–1538,
doi:10.1109/ISIT.2005.1523601.
A. Ehrenfeucht & G. Rozemberg (1986):
Each regular code is included in a maximal regular code.
RAIRO Inform. Theor. Appl. 20,
pp. 89–96.
Güney Gönenç (1973):
Unique decipherability of codes with constraints with application to syllabification of Turkish words.
In: COLING 1973: Computational And Mathematical Linguistics: Proceedings of the International Conference on Computational Linguistics 1,
pp. 183–193.
Fernando Guzmán (1999):
Decipherability of codes.
J. Pure Appl. Algebra 141(1),
pp. 13–35,
doi:10.1016/S0022-4049(98)00019-X.
Tom Head & Andreas Weber (1995):
Deciding Multiset Decipherability.
IEEE Trans. Inform. Theory 41(1),
pp. 291–297,
doi:10.1109/18.370097.
Abraham Lempel (1986):
On multiset decipherable codes.
IEEE Trans. Inform. Theory 32(5),
pp. 714–716,
doi:10.1109/TIT.1986.1057217.
Antonio Restivo (1989):
A note on multiset decipherable codes.
IEEE Trans. Inform. Theory 35(3),
pp. 662–663,
doi:10.1109/18.30991.
Andreas Weber & Tom Head (1996):
The Finest Homophonic Partition and Related Code Concepts.
IEEE Trans. Inform. Theory 42(5),
pp. 1569–1575,
doi:10.1109/18.532902.
eptcs@eptcs.org