zbMATH — the first resource for mathematics

On extendibility of unavoidable sets. (English) Zbl 0629.68080
See the review of the preliminary version [Lect. Notes Comput. Sci. 166, 326-338 (1984)] in Zbl 0551.68068.

68Q45 Formal languages and automata
20M35 Semigroups in automata theory, linguistics, etc.
20M05 Free semigroups, generators and relations, word problems
Full Text: DOI
[1] M. Crochemore, M. le Rest and P. Wender, Sur les ensembles inevitables, Inform. Process Lett., to appear.
[2] Lentin, A.; Schutzenberger, M.P., A combinatorial problem in the theory of free monoids, (), 128-144 · Zbl 0221.20076
[3] Schutzenberger, M.P., On the synchronizing properties of certain prefix codes, Information and control, 7, 23-36, (1964) · Zbl 0122.15004
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.