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 条

[1] ON THE SUBWORD COMPLEXITY OF M-FREE D0L LANGUAGES
EHRENFEUCHT, A
ROZENBERG, G
INFORMATION PROCESSING LETTERS, 1983, 17 (03) : 121 - 124
[2] Subword complexity of uniform D0L words over finite groups
Goldstein, Ilya
THEORETICAL COMPUTER SCIENCE, 2011, 412 (41) : 5728 - 5743
[3] BOUNDED D0L LANGUAGES
HEAD, T
LANDO, B
THEORETICAL COMPUTER SCIENCE, 1987, 51 (03) : 255 - 264
[4] ADHERENCES OF D0L LANGUAGES
HEAD, T
THEORETICAL COMPUTER SCIENCE, 1984, 31 (1-2) : 139 - 149
[5] PERIODIC D0L LANGUAGES
HEAD, T
LANDO, B
THEORETICAL COMPUTER SCIENCE, 1986, 46 (01) : 83 - 89
[6] Results concerning thinness of D0L languages
Honkala, J
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2000, 10 (02) : 209 - 216
[7] The equivalence problem for languages defined by transductions on D0L languages
Honkala, J
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2005, 82 (08) : 911 - 918
[8] A NOTE ON THE COMPLEXITY OF GENERAL D0L MEMBERSHIP
JONES, ND
SKYUM, S
SIAM JOURNAL ON COMPUTING, 1981, 10 (01) : 114 - 117
[9] Circuit complexity of testing square-free numbers
Bernasconi, A
Shparlinski, I
STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 47 - 56
[10] ON THE D0L REPETITION THRESHOLD
Goldstein, Ilya
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2010, 44 (03): : 281 - 292

← 1 2 3 4 5 →