Facchini, Alessandro and Michalewski, Henryk (2014) Deciding the Borel Complexity of Regular Tree Languages. In: Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings.
![[img]](http://repository.supsi.ch/style/images/fileicons/text.png) |
Text
1403.3502 - Draft Version Download (10kB) |
Official Website: http://dx.doi.org/10.1007/978-3-319-08019-2_17
| Item Type: | Article in conference proceedings or Presentation at a conference (Paper) |
|---|---|
| Subjects: | Computer sciences > Computer science > Computational science foundations |
| Depositing User: | Alessandro Facchini |
| Date Deposited: | 12 Feb 2015 06:33 |
| Last Modified: | 12 Feb 2015 06:33 |
| URI: | http://repository.supsi.ch/id/eprint/6126 |
Actions (login required)
 |
View Item |