Szczepan Hummel
From MaRDI portal
Person:2909623
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Unambiguous tree languages are topologically harder than deterministic ones | 2021-04-27 | Paper |
| Unambiguous tree languages are topologically harder than deterministic ones (available as arXiv preprint) | 2021-04-27 | Paper |
| On unambiguous regular tree languages of index \((0,2)\) | 2017-08-31 | Paper |
| The topological complexity of MSO+U and related automata models Fundamenta Informaticae | 2012-09-06 | Paper |
| On the Borel inseparability of game tree languages | 2012-04-24 | Paper |
| On the Borel inseparability of game tree languages (available as arXiv preprint) | 2012-04-24 | Paper |
| On the topological complexity of MSO+U and related automata models Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Research outcomes over time
This page was built for person: Szczepan Hummel
