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

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

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)

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

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)