Topology on words

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.

[1]  R. Lindner,et al.  Algebraische Codierungstheorie : Theorie d. sequentiellen Codierungen , 1977 .

[2]  Ludwig Staiger.  Sequential Mappings of omega-Languages , 1987, RAIRO Theor. Informatics Appl..

[3]  Cristian S. Calude,et al.  A topological characterization of random sequences , 2003, Inf. Process. Lett..

[4]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[5]  A. Salomaa.  Lindner, R./Staiger, L., Algebraische Codierungstheorie, Theorie der sequentiellen Codierungen. Berlin, Akademie-Verlag 1977. 268 S., M 48,– , 1979 .

[6]  Marshall Hall,et al.  A Topology for Free Groups and Related Groups , 1950 .

[7]  Herman Walter.  Topologies on formal languages , 2005, Mathematical systems theory.

[8]  Arto Salomaa,et al.  On Infinite Words Obtained by Iterating Morphisms , 1982, Theor. Comput. Sci..

[9]  Roman R. Redziejowski.  Infinite-Word Languages and Continuous Mappings , 1986, Theor. Comput. Sci..

[10]  Alberto Apostolico,et al.  String Editing and Longest Common Subsequences , 1997, Handbook of Formal Languages.

[11]  James A. Anderson.  Automata Theory with Modern Applications: Languages and codes , 2006 .

[12]  Janusz A. Brzozowski,et al.  Continuous Languages , 2008, AFL.

[13]  R. Milner.  Mathematical Centre Tracts , 1976 .

[14]  Tom Head.  The Topological Structure of Adherences of Regular Languages , 1986, RAIRO Theor. Informatics Appl..

[15]  Dominique Perrin.  Automata and formal languages , 2003 .

[16]  Ludwig Staiger.  Topologies for the set of disjunctive ω-words , 2005 .

[17]  H. Shyr.  Free monoids and languages , 1979 .

[18]  Pierre-Cyrille Héam,et al.  Automata for Pro-V Topologies , 2000, CIAA.

[19]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[20]  Maurice Nivat,et al.  Automata on Infinite Words , 1985, Lecture Notes in Computer Science.

[21]  Maurice Nivat,et al.  Adherences of Languages , 1980, J. Comput. Syst. Sci..

[22]  Y. A. Choueka.  Structure Automata , 1974, IEEE Transactions on Computers.

[23]  Rani Siromoney,et al.  On Infinite Words Obtained by Selective Substitution Grammars , 1985, Theor. Comput. Sci..

[24]  J. Bétréma.  Topologies sur des Espaces Ordonnés , 1982, RAIRO Theor. Informatics Appl..

[25]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[26]  Cristian S. Calude,et al.  Is independence an exception? , 1994, Applied Mathematics and Computation.

[27]  Cristian S. Calude.  On metrizability of the free monoids , 1976, Discret. Math..

[28]  Evelyn Nelson.  Categorical and topological aspects of formal languages , 2005, Mathematical systems theory.

[29]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[30]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[31]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.

[32]  Michel Latteux,et al.  Two Characterizations of Rational Adherences , 1986, Theor. Comput. Sci..

[33]  Lila Kari,et al.  Morphisms preserving densities , 2001, Int. J. Comput. Math..

[34]  Cristian S. Calude,et al.  Additive Distances and Quasi-Distances Between Words , 2002, J. Univers. Comput. Sci..

[35]  Tom Head.  The adherences of languages as topological spaces , 1984, Automata on Infinite Words.

[36]  Sorin Istrail.  Some Remarks on Non-Algebraic Adherences , 1982, Theor. Comput. Sci..

[37]  Solomon Marcus,et al.  Introduction mathématique à la linguistique structurale , 1967 .

[38]  Ludwig Staiger,et al.  Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen , 1974, J. Inf. Process. Cybern..

[39]  Helmut Prodinger.  Topologies on Free Monoids Induced by Families of Languages , 1983, RAIRO Theor. Informatics Appl..

[40]  Arun K. Srivastava,et al.  A Topology for Automata: A Note , 1976, Inf. Control..

[41]  Tom Head.  Adherence Equivalence Is Decidable for DOL Languages , 1984, STACS.

[42]  Rani Siromoney,et al.  Subword Topology , 1986, Theor. Comput. Sci..

[43]  Jean-Eric Pin,et al.  Topologies for the free monoid , 1991 .

[44]  Jean-Éric Pin.  Polynomial Closure of Group Languages and Open Sets of the Hall Topology , 1994, ICALP.

[45]  Werner Kuich,et al.  Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata , 1997, Handbook of Formal Languages.

[46]  Cristian S. Calude,et al.  On topologies generated by Moisil resemblance relations , 1979, Discret. Math..

[47]  Helmut Jürgensen,et al.  Disjunctive omega-Languages , 1983, J. Inf. Process. Cybern..

[48]  Dean Kelley,et al.  Automata and formal languages: an introduction , 1995 .

[49]  Tom Head,et al.  Adherences of D0L Languages , 1984, Theor. Comput. Sci..

[50]  Alexandru Dinca.  The Metric Properties on the Semigroups and the Languages , 1976, MFCS.

[51]  Huei-Jan Shyr,et al.  F-Disjunctive languagest , 1986 .

[52]  Helmut Prodinger,et al.  Topologies on Free Monoids Induced by Closure Operators of a Special Type , 1980, RAIRO Theor. Informatics Appl..

[53]  A. Clifford,et al.  The algebraic theory of semigroups , 1964 .

[54]  Jean-Eric Pin,et al.  A conjecture on the Hall topology for the free group , 1991 .

[55]  Helmut Jürgensen,et al.  Homomorphisms Preserving Types of Density , 2009, Acta Cybern..