Showing cs.LOShow all
2 papers · 1 filter
cs.LO2008
On Infinite Real Trace Rational Languages of Maximum Topological Complexity
Olivier Finkel, Jean-Pierre Ressayre, Pierre Simonnet
We consider the set of infinite real traces, over a dependence alphabet (Gamma, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove t…
cs.LO2008
Topology and Ambiguity in Omega Context Free Languages
Olivier Finkel, Pierre Simonnet
We study the links between the topological complexity of an omega context free language and its degree of ambiguity. In particular, using known facts from classical descriptive set…