Polishness of Some Topologies Related to Automata

Abstract : We prove that the Büchi topology, the automatic topology, the alphabetic topology and the strong alphabetic topology are Polish, and provide consequences of this.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [31 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01590185
Contributor : Olivier Finkel <>
Submitted on : Tuesday, September 19, 2017 - 12:46:41 PM
Last modification on : Thursday, April 4, 2019 - 1:33:17 AM

File

LIPIcs-CSL-2017-22.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Olivier Carton, Olivier Finkel, Dominique Lecomte. Polishness of Some Topologies Related to Automata. 26th EACSL Annual Conference on Computer Science and Logic (CSL 2017), Aug 2017, Stockholm, Sweden. pp.22:1-22:16, ⟨10.4230/LIPIcs.CSL.2017.22⟩. ⟨hal-01590185⟩

Share

Metrics

Record views

235

Files downloads

60