bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

On the Borel Inseparability of Game Tree Languages Szczepan Hummel Henryk Michalewski Damian Niwinski [github]
Topological Complexity of Sets De ned by Automata and Formulas Szczepan Hummel [github]
On Unambiguous Regular Tree Languages of Index (0,2) Jacques Duparc Kevin Fournier Szczepan Hummel [github]
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones Szczepan Hummel [github]
On the Topological Complexity of MSO+U and Related Automata Models Szczepan Hummel Michał Skrzypczak Szymon Toruńczyk [github]

Library Size: 13G (5 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge
[show logs] [hide logs]