On some sets of dictionaries whose ω -po
✍
Olivier Finkel
📂
Article
📅
2010
🏛
John Wiley and Sons
🌐
English
⚖ 147 KB
A dictionary is a set of finite words over some finite alphabet X. The ω-power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V . Lecomte studied in [10] the complexity of the set of dictionaries whose associated ω-powers have a given complexity. In par