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 条

[1] ON A BOUND FOR THE D0L SEQUENCE EQUIVALENCE PROBLEM
EHRENFEUCHT, A
ROZENBERG, G
THEORETICAL COMPUTER SCIENCE, 1980, 12 (03) : 339 - 342
[2] Bounds for the D0L language equivalence problem
Honkala, J
INFORMATION AND COMPUTATION, 2004, 190 (01) : 70 - 80
[3] A new bound for the D0L language equivalence problem
Juha Honkala
Acta Informatica, 2018, 55 : 81 - 88
[4] A new bound for the D0L sequence equivalence problem
Juha Honkala
Acta Informatica, 2007, 43 : 419 - 429
[5] D0L sequence equivalence is in P for fixed alphabets
Ruohonen, Keijo
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2008, 42 (02): : 361 - 374
[6] A new bound for the D0L language equivalence problem
Honkala, Juha
ACTA INFORMATICA, 2018, 55 (01) : 81 - 88
[7] A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem
J. Honkala
Theory of Computing Systems, 2001, 34 : 263 - 272
[8] Equivalence problem of D0L and DF0L power series
Honkala, Juha
Fundamenta Informaticae, 1999, 38 (1-2): : 201 - 208
[9] The equivalence problem for languages defined by transductions on D0L languages
Honkala, J
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2005, 82 (08) : 911 - 918
[10] BOUNDED D0L LANGUAGES
HEAD, T
LANDO, B
THEORETICAL COMPUTER SCIENCE, 1987, 51 (03) : 255 - 264

← 1 2 3 4 5 →