Weighted finite automata and metrics in cantor space

Authors:
Ludwig Staiger
Affiliations:
Institut für Informatik, Martin-Luther-Universität Halle- Wittenberg, von-Seekendorff-Platz 1, D-06099 Halle, Germany
Venue:
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Year:
2003

Citing 6
Cited 3

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Fairness, distances and degrees

Theoretical Computer Science
Rational and affine expressions for image description

Discrete Applied Mathematics
Finite Automata Computing Real Functions

SIAM Journal on Computing
&ohgr;-languages

Handbook of formal languages, vol. 3
Iterated function systems and control languages

Information and Computation

A topological characterization of random sequences

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

Acta Cybernetica
Pushdown dimension

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how weighted finite automata define topologies on the set of all ω-words over a finite alphabet X. Moreover, we give a characterization of these topologies in terms of topologies on Xω induced by languages U ⊆ X*.