Topologies for the set of disjunctive ω-words

  • Ludwig Staiger

Abstract

An infinite sequence (ω-word) is referred to as disjunctive provided it contains every finite word as infix (factor). As Jürgensen and Thierrin [JT83] observed the set of disjunctive ω-words, D, has a trivial syntactic monoid but is not accepted by a finite automaton. In this paper we derive some topological properties of the set of disjunctive ω-words. We introduce two non-standard topologies on the set of all ω-words and show that D fulfills some special properties with respect to these topologies. In the first topology - the so-called topology of forbidden words - D is the smallest nonempty Gδ-set, and in the second one D is the set of accumulation points of the whole space as well as of itself.

Downloads

Download data is not yet available.
Published
2005-01-01
How to Cite
Staiger, L. (2005). Topologies for the set of disjunctive ω-words. Acta Cybernetica, 17(1), 43-51. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3653
Section
Regular articles