Polishness of some topologies related to word or tree automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2019

Polishness of some topologies related to word or tree automata

Résumé

We prove that the B\"uchi topology and the automatic topology are Polish. We also show that this cannot be fully extended to the case of a space of infinite labelled binary trees; in particular the B\"uchi and the Muller topologies are not Polish in this case.
Fichier principal
Vignette du fichier
Published-paper-LMCS-2019.pdf (427.86 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-01593160 , version 1 (05-10-2017)
hal-01593160 , version 2 (24-08-2018)
hal-01593160 , version 3 (10-05-2019)

Identifiants

Citer

Olivier Carton, Olivier Finkel, Dominique Lecomte. Polishness of some topologies related to word or tree automata. Logical Methods in Computer Science, 2019, ⟨10.23638/LMCS-15(2:9)2019⟩. ⟨hal-01593160v3⟩
307 Consultations
176 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More