Olivier Finkel ; Olivier Carton ; Dominique Lecomte - Polishness of some topologies related to word or tree automata

lmcs:4024 - Logical Methods in Computer Science, May 8, 2019, Volume 15, Issue 2 - https://doi.org/10.23638/LMCS-15(2:9)2019
Polishness of some topologies related to word or tree automataArticle

Authors: Olivier Finkel ; Olivier Carton ; Dominique Lecomte

    We prove that the Büchi 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üchi and the Muller topologies are not Polish in this case.

    Comment: This paper is an extended version of a paper which appeared in the proceedings of the 26th EACSL Annual Conference on Computer Science and Logic, CSL 2017. The main addition with regard to the conference paper consists in the study of the Büchi topology and of the Muller topology in the case of a space of trees, which now forms Section 4

    https://doi.org/10.23638/LMCS-15(2:9)2019
    Source: arXiv.org:1710.04002
    Volume: Volume 15, Issue 2
    Published on: May 8, 2019
    Accepted on: March 15, 2019
    Submitted on: October 27, 2017
    Keywords: Mathematics - Logic, Computer Science - Formal Languages and Automata Theory, Computer Science - Logic in Computer Science
    Licence: Attribution 4.0 International (CC BY 4.0)

    Share and export

    Consultation statistics

    This page has been seen 3136 times.
    This article's PDF has been downloaded 362 times.