Abstract
Two new and simple proofs of Schützenberger's theorem on codes with bounded deciphering delay are given, using automata with bounded delay.
This article was processed using the LATEX macro package with LMAMULT style
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Almeida, J.: Some algorithms on the star operation applied to finite languages. Semigroup Forum 28 (1984) 187–197.
Ashley, J., Marcus, B., Perrin, D., Tuncel, S.: Surjective extensions of sliding-block codes. Report LITP n∘ 91-23, Univ. Paris 6–7 (1991).
Berstel, J., Perrin, D.: ”Theory of codes”. Academic Press, London New York (1985).
Berstel, J., Perrin, D., Perrot, J.F., Restivo, A.: Sur le théorème du défaut. J. Algebra 60 (1979) 169–180.
Bruyère, V., Wang Limin, Zhang Liang: On completion of codes with finite deciphering delay. Europ. J. Combinatorics 11 (1990) 513–521.
Bruyère, V.: Codes. Thesis, Univ. Mons-Hainaut (1991).
Capocelli, R.M.: A note on uniquely decipherable codes. IEEE Trans. Inform. Theory IT-25 (1979) 90–94.
Choffrut, C.: Une caractérisation des codes à délai borné par leur fonction de décodage. in “Théorie des codes” (D. Perrin Ed.) LITP (1979) 47–56.
Cori, R: Codes à délai borné maximaux. in “Théorie des codes” (D. Perrin Ed.) LITP (1979) 57–74.
De Luca, A., Perrin, D., Restivo, A., Termini, S.: Synchronization and simplification. Discrete Math. 27 (1979) 287–308.
Devolder, J., Latteux, M., Litovsky, I., Staiger, L.: Codes and infinite words. Report LIFL n∘ 220, Univ. Lille (1991).
Honkala, J., Salomaa, A.: L morphisms: bounded delay and regularity of ambiguity. Proc. ICALP'91, Lecture Notes in Comput. Sci. 510 (1991) 566–574.
Karabed, R., Marcus, B.: Sliding-block coding for input-restricted channel. IEEE Trans. Inform. Theory IT-34 (1988) 1–26.
Karhumäki, J.: On three-element codes. Theoret. Comput. Sci 40 (1985) 3–11.
Laporte, E.: A formal tool for modelling “Standart” Phonetic Variations. in Proceedings of the ESCA Workshop on Phonetics and Phonology of Speaking Styles, Universidad autonoma de Barcelona (1991) p. 39–1, 39–7.
Levenshtein, V.I.: Some properties of coding and self adjusting automata for decoding messages. Problemy Kibernetiki 11 (1964) 63–121.
Nguyen Huong Lâm, Do Long Van: On a class of infinitary codes. Theoret. Comput. Sci. 24 (1990) 441–458.
Salomaa, A.: “Jewels of formal language theory”. Computer Science Press, Rockville (1981).
Sardinas, A.A., Patterson, C.W.: A necessary and sufficient condition for the unique decomposition of coded messages. IRE Internat. Conv. Rec. 8 (1953) 104–108.
Schützenberger, M.P.: Une théorie algébrique du codage. Séminaire Dubreil-Pisot, Exposé n∘ 15 (1955).
Schützenberger, M.P.: Sur certains sous-monoïdes libres. Bull. Soc. Math. de France 93 (1965) 209–223.
Schützenberger, M.P.: On a question concerning certain free submonoids. J. Combin. Theory 1 (1966) 437–442.
Staiger, L.: On infinitary finite length codes. RAIRO Inform. Theor. 20 (1986) 483–494.
Zipstein, M., Crochemore, M.: Transducteurs arithmétiques. Report LITP n∘ 89.12, Univ. 6–7 (1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bruyère, V. (1992). Automata and codes with bounded deciphering delay. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023821
Download citation
DOI: https://doi.org/10.1007/BFb0023821
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55284-0
Online ISBN: 978-3-540-47012-0
eBook Packages: Springer Book Archive