5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.FL2012★ 5 cited
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones
Szczepan Hummel
The paper gives an example of a tree language G that is recognised by an unambiguous parity automaton and is analytic-complete as a set in Cantor space. This already shows that the…
math.LO2009★ 1 cited
On the Borel Inseparability of Game Tree Languages
Szczepan Hummel, Henryk Michalewski, Damian Niwinski
The game tree languages can be viewed as an automata-theoretic counterpart of parity games on graphs. They witness the strictness of the index hierarchy of alternating tree automat…