![]() | ![]() |
| 2012 | ||
|---|---|---|
| 3 | Henryk Michalewski, Damian Niwinski: On Topological Completeness of Regular Tree Languages. Logic and Program Semantics 2012: 165-179 | |
| 2 | André Arnold, Henryk Michalewski, Damian Niwinski: On the separation question for tree languages. STACS 2012: 396-407 | |
| 2009 | ||
| 1 | Szczepan Hummel, Henryk Michalewski, Damian Niwinski: On the Borel Inseparability of Game Tree Languages. STACS 2009: 565-575 | |
| 1 | André Arnold | [2] |
| 2 | Szczepan Hummel | [1] |
| 3 | Damian Niwinski | [1] [2] [3] |
Data released under the ODC-BY 1.0 license — See also our legal information page