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 条

[21] Some Results on Primitive Words, Square-Free Words, and Disjunctive Languages
Moriya, Tetsuo
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2008, E91D (10) : 2514 - 2516
[22] On sequences defined by D0L power series
Honkala, J
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1999, 33 (02): : 125 - 132
[23] Nondeterministic automatic complexity of overlap-free and almost square-free words
Hyde, Kayleigh K.
Kjos-Hanssen, Bjorn
ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (03):
[24] Bounds for the D0L language equivalence problem
Honkala, J
INFORMATION AND COMPUTATION, 2004, 190 (01) : 70 - 80
[25] A characterization of rational D0L power series
Honkala, Juha
ACTA INFORMATICA, 2011, 48 (01) : 19 - 24
[26] PERIODICITY AND ULTIMATE PERIODICITY OF D0L SYSTEMS
LANDO, B
THEORETICAL COMPUTER SCIENCE, 1991, 82 (01) : 19 - 33
[27] Equivalence problem of D0L and DF0L power series
Honkala, Juha
Fundamenta Informaticae, 1999, 38 (1-2): : 201 - 208
[28] On infinite words generated by polynomial D0L systems
Honkala, J.
Discrete Applied Mathematics, 2002, 116 (03) : 339 - 347
[29] A new bound for the D0L language equivalence problem
Juha Honkala
Acta Informatica, 2018, 55 : 81 - 88
[30] A new proof for the decidability of D0L ultimate periodicity
Halava, Vesa
Harjuand, Tero
Karki, Tomi
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 147 - 151

← 1 2 3 4 5 →