SIMPLE REDUCTIONS BETWEEN D0L LANGUAGE AND SEQUENCE EQUIVALENCE PROBLEMS

被引：5

作者：

SALOMAA, A ^{[1
]}

机构：

[1] UNIV TURKU,ACAD FINLAND,SF-20500 TURKU 50,FINLAND

来源：

DISCRETE APPLIED MATHEMATICS | 1993年 / 41卷 / 03期

关键词：

D O I：

10.1016/0166-218X(90)90061-G

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We show by a simple argument how any algorithm for solving the DOL language equivalence problem can be used to solve the DOL sequence equivalence problem, and vice versa.

引用

页码：271 / 274

页数：4

共 50 条

[31] Marked D0L systems and the 2n-conjecture
Honkala, Juha
THEORETICAL COMPUTER SCIENCE, 2012, 432 : 94 - 97
[32] ON THE SUBWORD COMPLEXITY OF M-FREE D0L LANGUAGES
EHRENFEUCHT, A
ROZENBERG, G
INFORMATION PROCESSING LETTERS, 1983, 17 (03) : 121 - 124
[33] ON THE SUBWORD COMPLEXITY OF SQUARE-FREE D0L LANGUAGES
EHRENFEUCHT, A
ROZENBERG, G
THEORETICAL COMPUTER SCIENCE, 1981, 16 (01) : 25 - 32
[34] 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
[35] 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
[36] An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet
Honkala, J
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2005, 71 (04) : 506 - 519
[37] Subword complexity of uniform D0L words over finite groups
Goldstein, Ilya
THEORETICAL COMPUTER SCIENCE, 2011, 412 (41) : 5728 - 5743
[38] Watson-Crick D0L systems:: The power of one transition
Salomaa, A
Sosík, P
THEORETICAL COMPUTER SCIENCE, 2003, 301 (1-3) : 187 - 200
[39] Networks of Watson-Crick D0L systems with communication by substrings
Csuhaj-Varju, Erzsebet
Vaszil, Gyorgy
THEORETICAL COMPUTER SCIENCE, 2024, 995
[40] Uni-transitional Watson-Crick D0L systems
Salomaa, A
THEORETICAL COMPUTER SCIENCE, 2002, 281 (1-2) : 537 - 553

← 1 2 3 4 5 →