Topology on words

Authors:
Cristian S. Calude;Helmut Jürgensen;Ludwig Staiger
Affiliations:
The University of Auckland, New Zealand;The University of Western Ontario, London, Canada;Martin-Luther-Universität Halle-Wittenberg, Germany
Venue:
Theoretical Computer Science
Year:
2009

Citing 15
Cited 0

Infinite-word languages and continuous mappings

Theoretical Computer Science
Subword topology

Theoretical Computer Science
Two characterizations of rational adherences

Theoretical Computer Science
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Is independence an exception?

Applied Mathematics and Computation
Semirings and formal power series: their relevance to formal languages and automata

Handbook of formal languages, vol. 1
String editing and longest common subsequences

Handbook of formal languages, vol. 2
&ohgr;-languages

Handbook of formal languages, vol. 3
Handbook of Formal Languages

Handbook of Formal Languages
The adherences of languages as topological spaces

Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Polynomial Closure of Group Languages and Open Sets of the Hall Topology

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Adherence Equivalence Is Decidable for DOL Languages

STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
A topological characterization of random sequences

Information Processing Letters
Topologies for the set of disjunctive ω-words

Acta Cybernetica
Structure Automata

IEEE Transactions on Computers

Quantified Score

Hi-index	5.23

Visualization

Abstract

We investigate properties of topologies on sets of finite and infinite words over a finite alphabet. The guiding example is the topology generated by the prefix relation on the set of finite words, considered as a partial order. This partial order extends naturally to the set of infinite words; hence it generates a topology on the union of the sets of finite and infinite words. We consider several partial orders which have similar properties and identify general principles according to which the transition from finite to infinite words is natural. We provide a uniform topological framework for the set of finite and infinite words to handle limits in a general fashion.