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