Infinite Lyndon words

Infinite Lyndon words

We define an infinite Lyndon word as the limit of an increasing sequence of prefix preserving lyndon words and show that some of the interesting properties of Lyndon words generalize to the infinite case. We construct a queue automaton that recognizes the set of Lyndon words and show that it can be...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1994-04, Vol.50 (2), p.101-104
Hauptverfasser: Siromoney, Rani, Mathew, Lisa, Dare, V.R., Subramanian, K.G.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Automata. Abstract machines. Turing machines
Computer languages
Computer science
control theory
systems
Exact sciences and technology
Formal languages
Infinite words
Language theory and syntactical analysis
Lyndon words
Mathematical models
Queue automata
Queuing
Studies
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We define an infinite Lyndon word as the limit of an increasing sequence of prefix preserving lyndon words and show that some of the interesting properties of Lyndon words generalize to the infinite case. We construct a queue automaton that recognizes the set of Lyndon words and show that it can be extended to recognize infinite Lyndon words. We discuss certain topological properties of the set of infinite Lyndon words such as homeomorphism with a subspace of the Cantor space.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(94)90016-7