2026-07-21T21:02:37Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7672 2024-03-06T10:40:45Z ddc:004 open_access

Polishness of Some Topologies Related to Automata Carton, Olivier Finkel, Olivier Lecomte, Dominique Automata and formal languages; logic in computer science; infinite words; Büchi automaton; regular omega-language; Cantor space; finer topologies; Büc 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Olivier Carton and Olivier Finkel and Dominique Lecomte 2017 Is Part Of LIPIcs, Volume 82, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2017.22 urn:nbn:de:0030-drops-76728 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.22 eng https://creativecommons.org/licenses/by/3.0/legalcode