Polishness of Some Topologies Related to Automata - Archive ouverte HAL
Conference Papers Year : 2017

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.

Domains

Logic [math.LO]
Fichier principal
Vignette du fichier
LIPIcs-CSL-2017-22.pdf (460.69 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Olivier Finkel  : Connect in order to contact the contributor

https://hal.science/hal-01590185

Submitted on : Tuesday, September 19, 2017-12:46:41 PM

Last modification on : Tuesday, October 8, 2024-10:43:36 AM

Download

Dates and versions

hal-01590185 , version 1 (19-09-2017)

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-PARIS7 UPMC CNRS INSMI IMJ USPC SORBONNE-UNIVERSITE SU-SCIENCES UP-SCIENCES IRIF
169 View
114 Download

Altmetric

Share

More