Weak index versus Borel rank
| dc.creator | Murlak, Filip | |
| dc.date | 2008-02-20 | |
| dc.date.accessioned | 2026-07-07T09:22:01Z | |
| dc.date.available | 2026-07-07T09:22:01Z | |
| dc.description | We investigate weak recognizability of deterministic languages of infinite trees. We prove that for deterministic languages the Borel hierarchy and the weak index hierarchy coincide. Furthermore, we propose a procedure computing for a deterministic automaton an equivalent minimal index weak automaton with a quadratic number of states. The algorithm works within the time of solving the emptiness problem. | |
| dc.identifier | https://arxiv.org/abs/0802.2842 | |
| dc.identifier | http://arxiv.org/abs/0802.2842 | |
| dc.identifier | Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (2008) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155231 | |
| dc.subject | Information Theory | |
| dc.title | Weak index versus Borel rank | |
| dc.type | text |