文章基本信息

标题：Polishness of Some Topologies Related to Automata
本地全文：下载
作者：Olivier Carton ; Olivier Finkel ; Dominique Lecomte 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：82
页码：22:1-22:16
DOI：10.4230/LIPIcs.CSL.2017.22
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Automata and formal languages; logic in computer science; infinite words; B{\"u