10 citations · 57 across the 48 of their papers we have counts for
Showing 2009 · math.LOShow all
2 papers · 2 filters
math.LO2009
On Some Sets of Dictionaries Whose omega-Powers Have a Given Complexity
Olivier Finkel
A dictionary is a set of finite words over some finite alphabet X. The omega-power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V.…
math.LO2009
On Recognizable Tree Languages Beyond the Borel Hierarchy
Olivier Finkel, Pierre Simonnet
We investigate the topological complexity of non Borel recognizable tree languages with regard to the difference hierarchy of analytic sets. We show that, for each integer $n \geq…