Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2017.22
URN: urn:nbn:de:0030-drops-76728
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7672/
Carton, Olivier ; Finkel, Olivier ; Lecomte, Dominique
Polishness of Some Topologies Related to Automata
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{carton_et_al:LIPIcs:2017:7672,
author = {Olivier Carton and Olivier Finkel and Dominique Lecomte},
title = {{Polishness of Some Topologies Related to Automata}},
booktitle = {26th EACSL Annual Conference on Computer Science Logic (CSL 2017)},
pages = {22:1--22:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-045-3},
ISSN = {1868-8969},
year = {2017},
volume = {82},
editor = {Valentin Goranko and Mads Dam},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7672},
URN = {urn:nbn:de:0030-drops-76728},
doi = {10.4230/LIPIcs.CSL.2017.22},
annote = {Keywords: Automata and formal languages; logic in computer science; infinite words; B{\"u}chi automaton; regular omega-language; Cantor space; finer topologies; B{\"u}c}
}
| Keywords: | Automata and formal languages; logic in computer science; infinite words; Büchi automaton; regular omega-language; Cantor space; finer topologies; Büc | |
| Seminar: | 26th EACSL Annual Conference on Computer Science Logic (CSL 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 16.08.2017 |
