An optimal test on finite unavoidable sets of words

DOI10.1016/0020-0190(83)90119-9zbMATH Open0506.68057DBLPjournals/ipl/CrochemoreRW83OpenAlexW2010820635WikidataQ61677990 ScholiaQ61677990MaRDI QIDQ1836993FDOQ1836993

Authors: Maxime Crochemore, Michel Le Rest, Philippe Wender 

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90119-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Avoidable patterns in strings of symbols
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the synchronizing properties of certain prefix codes

Cited In (6)

• Unavoidable sets of words of uniform length
• Unavoidable languages, cuts and innocent sets of words
• Number of holes in unavoidable sets of partial words. I.
• Inventories of unavoidable languages and the word-extension conjecture
• Minimum number of holes in unavoidable sets of partial words of size three
• Unavoidable sets of partial words of uniform length

This page was built for publication: An optimal test on finite unavoidable sets of words

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