Unavoidable Set: Extension and Reduction

DOI10.1051/ITA:1999114MaRDI QIDQ4718891zbMATH OpenOpenAlexFDO

Authors

Publication date 8 February 2000

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_1999__33_3_213_0/, https://eudml.org/doc/221975

zbMATH Keywords

word sets

Mathematics Subject Classification ID

Combinatorics on words (68R15) Natural language processing (68T50)

Recommendations

• Unavoidable sets
• Unavoidable sets of words of uniform length
• UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS
• The length of short words in unavoidable sets
• UNAVOIDABLE SETS OF CONSTANT LENGTH

Cites work

• Efficient string matching
• Inventories of unavoidable languages and the word-extension conjecture
• On extendibility of unavoidable sets
• On regularity of context-free languages
• On the synchronizing properties of certain prefix codes

Cited in

(8)

• UNAVOIDABLE AND ALMOST UNAVOIDABLE SETS OF WORDS
• Unavoidable sets of words of uniform length
• Unavoidable sets
• Insufficiency of four known necessary conditions on string unavoidability
• scientific article; zbMATH DE number 4072416 (Why is no real title available?)
• Developments in Language Theory
• scientific article; zbMATH DE number 3878386 (Why is no real title available?)
• The length of short words in unavoidable sets

This page was built for publication: Unavoidable Set: Extension and Reduction

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