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

lmcs:4024 - Logical Methods in Computer Science, May 8, 2019, Volume 15, Issue 2
Polishness of some topologies related to word or tree automata

Authors: Finkel, Olivier and Carton, Olivier and Lecomte, Dominique

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.


Source : oai:arXiv.org:1710.04002
Volume: Volume 15, Issue 2
Published on: May 8, 2019
Submitted on: October 27, 2017
Keywords: Mathematics - Logic,Computer Science - Formal Languages and Automata Theory,Computer Science - Logic in Computer Science


Share