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 条

[41] The special L-value of the winding quotient of square-free level
Agashe, Amod
MANUSCRIPTA MATHEMATICA, 2016, 151 (3-4) : 493 - 504
[42] The special L-value of the winding quotient of square-free level
Amod Agashe
manuscripta mathematica, 2016, 151 : 493 - 504
[43] THE AUTOMORPHISM GROUP OF THE MODULAR CURVE X0*(N) WITH SQUARE-FREE LEVEL
Bars, Francesc
Gonzalez, Josep
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2021, 374 (08) : 5783 - 5803
[44] A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem
J. Honkala
Theory of Computing Systems, 2001, 34 : 263 - 272
[45] Watson-Crick D0L systems:: The power of one transition
Salomaa, A
Sosík, P
THEORETICAL COMPUTER SCIENCE, 2003, 301 (1-3) : 187 - 200
[46] Networks of Watson-Crick D0L systems with communication by substrings
Csuhaj-Varju, Erzsebet
Vaszil, Gyorgy
THEORETICAL COMPUTER SCIENCE, 2024, 995
[47] Uni-transitional Watson-Crick D0L systems
Salomaa, A
THEORETICAL COMPUTER SCIENCE, 2002, 281 (1-2) : 537 - 553
[48] The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings
Lunnon, Fred
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (01): : 130 - 148
[49] Square-free Lucas d-pseudoprimes and Carmichael-Lucas numbers
W. Carlip
L. Somer
Czechoslovak Mathematical Journal, 2007, 57 : 447 - 463
[50] Square-free Lucas d-pseudoprimes and Carmichael-Lucas numbers
Carlip, W.
Somer, L.
CZECHOSLOVAK MATHEMATICAL JOURNAL, 2007, 57 (01) : 447 - 463

← 1 2 3 4 5 →