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 条

[21] Equality sets of binary D0L sequences
Honkala, Juha
THEORETICAL COMPUTER SCIENCE, 2018, 740 : 63 - 67
[22] On images of D0L and DT0L power series
Honkala, J
THEORETICAL COMPUTER SCIENCE, 2003, 290 (03) : 1869 - 1882
[23] The Equivalence Problem of Polynomially Bounded D0L Systems— a Bound Depending Only on the Size of the Alphabet
Juha Honkala
Theory of Computing Systems, 2003, 36 : 89 - 103
[24] On sequences defined by D0L power series
Honkala, J
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1999, 33 (02): : 125 - 132
[25] Results concerning thinness of D0L languages
Honkala, J
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2000, 10 (02) : 209 - 216
[26] A NOTE ON THE COMPLEXITY OF GENERAL D0L MEMBERSHIP
JONES, ND
SKYUM, S
SIAM JOURNAL ON COMPUTING, 1981, 10 (01) : 114 - 117
[27] A characterization of rational D0L power series
Honkala, Juha
ACTA INFORMATICA, 2011, 48 (01) : 19 - 24
[28] PERIODICITY AND ULTIMATE PERIODICITY OF D0L SYSTEMS
LANDO, B
THEORETICAL COMPUTER SCIENCE, 1991, 82 (01) : 19 - 33
[29] On infinite words generated by polynomial D0L systems
Honkala, J.
Discrete Applied Mathematics, 2002, 116 (03) : 339 - 347
[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 →