ON THE SUBWORD COMPLEXITY OF SQUARE-FREE D0L LANGUAGES

被引：20
|
作者：
EHRENFEUCHT, A [1 ]
ROZENBERG, G [1 ]
机构：
[1] UNIV LEIDEN,INST APPL MATH & COMP SCI,LEIDEN,NETHERLANDS
来源：
THEORETICAL COMPUTER SCIENCE | 1981年 / 16卷 / 01期
关键词：
D O I：
10.1016/0304-3975(81)90028-1
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：25 / 32
页数：8
相关论文
共 50 条
  • [31] Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words
    Hyde, Kayleigh K.
    Kjos-Hanssen, Bjorn
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 61 - 70
  • [32] A new bound for the D0L sequence equivalence problem
    Juha Honkala
    Acta Informatica, 2007, 43 : 419 - 429
  • [33] A new bound for the D0L language equivalence problem
    Honkala, Juha
    ACTA INFORMATICA, 2018, 55 (01) : 81 - 88
  • [34] Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages
    Brzozowski, Janusz
    Jiaskova, Galina
    Li, Baiyu
    Smith, Joshua
    ACTA CYBERNETICA, 2014, 21 (04): : 507 - 527
  • [35] D0L sequence equivalence is in P for fixed alphabets
    Ruohonen, Keijo
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2008, 42 (02): : 361 - 374
  • [36] BIELLIPTIC MODULAR CURVES X0*(N) WITH SQUARE-FREE LEVELS
    Bars, Francesc
    Gonzalez Rovira, Josep
    MATHEMATICS OF COMPUTATION, 2019, 88 (320) : 2939 - 2957
  • [37] Marked D0L systems and the 2n-conjecture
    Honkala, Juha
    THEORETICAL COMPUTER SCIENCE, 2012, 432 : 94 - 97
  • [38] A PERIODIC DIVISION PATTERN THAT CANNOT BE GENERATED BY D0L SYSTEMS
    DEBOER, MJM
    LINDENMAYER, A
    TUZA, Z
    THEORETICAL COMPUTER SCIENCE, 1991, 83 (02) : 205 - 218
  • [39] SIMPLE REDUCTIONS BETWEEN D0L LANGUAGE AND SEQUENCE EQUIVALENCE PROBLEMS
    SALOMAA, A
    DISCRETE APPLIED MATHEMATICS, 1993, 41 (03) : 271 - 274
  • [40] The power of networks of Watson-Crick D0L systems
    Csuhaj-Varjú, E
    Salomaa, A
    ASPECTS OF MOLECULAR COMPUTING: ESSAYS DEDICATED TO TOM HEAD ON THE OCCASION OF HIS 70TH BIRTHDAY, 2004, 2950 : 106 - 118
12345