On extendibility of unavoidable sets
From MaRDI portal
Publication:1094146
DOI10.1016/0166-218X(84)90014-3zbMath0629.68080OpenAlexW2074970213MaRDI QIDQ1094146
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
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
On total regulators generated by derivation relations, Inventories of unavoidable languages and the word-extension conjecture, Unavoidable languages, cuts and innocent sets of words, Unnamed Item, Number of holes in unavoidable sets of partial words. I., Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three, Unavoidable sets, Unavoidable sets of partial words, Testing avoidability on sets of partial words is hard, Unavoidable Set: Extension and Reduction, THE LENGTH OF SHORT WORDS IN UNAVOIDABLE SETS, Unavoidable sets of words of uniform length
Cites Work
