INFINITE LYNDON WORDS

被引：37
|
作者：
SIROMONEY, R
MATHEW, L
DARE, VR
SUBRAMANIAN, KG
机构：
[1] Department of Mathematics, Madras Christian College, Madras, 600 059, Tambaran
来源：
INFORMATION PROCESSING LETTERS | 1994年 / 50卷 / 02期
关键词：
LYNDON WORDS; INFINITE WORDS; QUEUE AUTOMATA; FORMAL LANGUAGES;
D O I：
10.1016/0020-0190(94)90016-7
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：101 / 104
页数：4
相关论文
共 50 条
  • [41] A PUBLIC KEY CRYPTOSYSTEM BASED ON LYNDON WORDS
    SIROMONEY, R
    MATHEW, L
    [J]. INFORMATION PROCESSING LETTERS, 1990, 35 (01) : 33 - 36
  • [42] An Extension of the Lyndon Schutzenberger Result to Pseudoperiodic Words
    Czeizler, Elena
    Czeizler, Eugen
    Kari, Lila
    Seki, Shinnosuke
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2009, 5583 : 183 - +
  • [43] 2D Lyndon Words and Applications
    Marcus, Shoshana
    Sokol, Dina
    [J]. ALGORITHMICA, 2017, 77 (01) : 116 - 133
  • [44] 2D Lyndon Words and Applications
    Shoshana Marcus
    Dina Sokol
    [J]. Algorithmica, 2017, 77 : 116 - 133
  • [45] COUNTING SPECIAL SETS OF BINARY LYNDON WORDS
    YUCAS, JL
    [J]. ARS COMBINATORIA, 1991, 31 : 21 - 29
  • [46] Circle formation of weak robots and Lyndon words
    Dieudonne, Yoann
    Petit, Franck
    [J]. INFORMATION PROCESSING LETTERS, 2007, 101 (04) : 156 - 162
  • [47] LYNDON WORDS OF A SECOND-ORDER RECURRENCE
    Bastasz, Bob
    [J]. FIBONACCI QUARTERLY, 2020, 58 (05): : 25 - 29
  • [48] On k-ary Lyndon Words and their Generating Functions
    Kucukoglu, Irem
    Simsek, Yilmaz
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2016 (ICNAAM-2016), 2017, 1863
  • [49] Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
    Richomme, G.
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 380 (03) : 393 - 400
  • [50] An extension of the Lyndon-Schutzenberger result to pseudoperiodic words
    Czeizler, Elena
    Czeizler, Eugen
    Kari, Lila
    Seki, Shinnosuke
    [J]. INFORMATION AND COMPUTATION, 2011, 209 (04) : 717 - 730
12345