On extendibility of unavoidable sets

DOI10.1016/0166-218X(84)90014-3MaRDI QIDQ1094146zbMATH OpenOpenAlexFDO

Authors Christian Choffrut, Karel II Culik

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(84)90014-3

zbMATH Keywords

combinatorics on wordsfinite automataregularity of languages

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Review text

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

Cites work

• scientific article; zbMATH DE number 3350192 (Why is no real title available?)
• On the synchronizing properties of certain prefix codes

Cited in

(14)

• Testing avoidability on sets of partial words is hard
• On total regulators generated by derivation relations
• Inventories of unavoidable languages and the word-extension conjecture
• Unavoidable sets of words of uniform length
• Alternate definitions of the uncovered set and their implications
• Minimum number of holes in unavoidable sets of partial words of size three
• The length of short words in unavoidable sets
• Number of holes in unavoidable sets of partial words. I.
• Unavoidable Set: Extension and Reduction
• Unavoidable languages, cuts and innocent sets of words
• Unavoidable sets of partial words of uniform length
• Unavoidable sets
• Extending the reach of the point-to-set principle
• Unavoidable sets of partial words

This page was built for publication: On extendibility of unavoidable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094146)