×

On three-element codes. (English) Zbl 0574.68062

See the review of the preliminary version [Lect. Notes Comput. Sci. 172, 292-302 (1984; Zbl 0554.68055)].

MSC:

68Q45 Formal languages and automata
94A45 Prefix, length-variable, comma-free codes
20M35 Semigroups in automata theory, linguistics, etc.
20M05 Free semigroups, generators and relations, word problems

Citations:

Zbl 0554.68055
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Berstel, J.; Perrin, D., The theory of codes, (1985), Academic Press New York · Zbl 1022.94506
[2] Colomb, S.; Gordon, B., Codes with bounded synchronization delay, Inform. and control, 8, 355-372, (1965) · Zbl 0202.50404
[3] Karhumäki, J., A property of three-element codes, Theoret. comput. sci., 41, 2, 3, (1985), to appear · Zbl 0604.68082
[4] Karhumäki, J., The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids, Theoret. comput. sci., 29, 3, 285-308, (1984) · Zbl 0546.68060
[5] Lothaire, M., Combinatorics on words, (1983), Addison-Wesley Reading, MA · Zbl 0514.20045
[6] De Luca, A.; Perrin, D.; Restivo, A.; Termini, S., Synchronization and simplification, Discrete math., 27, 297-308, (1979) · Zbl 0417.68059
[7] Salomaa, A., Jewels of formal language theory, (1981), Computer Science Press Rochville, MD · Zbl 0487.68063
[8] Schützenberger, M.P., Une théorie algébrique du codage, () · Zbl 0053.40602
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.