The Sequence Equivalence Problem for Marked DT0L Systems

被引：0

作者：

Honkala, Juha ^{[1
]}

机构：

[1] Univ Turku, Dept Math, FI-20014 Turku, Finland

来源：

FUNDAMENTA INFORMATICAE | 2011年 / 110卷 / 1-4期

关键词：

DT0L system; DT0L sequence equivalence problem; marked morphism; decidability;

D O I：

10.3233/FI-2011-535

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We study the DT0L sequence equivalence problem for marked morphisms. We show that to decide this problem it is enough to consider initial terms involving at most 2n morphisms where n is the cardinality of the underlying alphabet.

引用

页码：175 / 182

页数：8

共 50 条

[1] Three variants of the DT0L sequence equivalence problem
Honkala, J
JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2001, 7 (10): : 886 - 892
[2] On the equivalence problem of context-free and DT0L languages
Honkala, J
DISCRETE APPLIED MATHEMATICS, 1999, 98 (1-2) : 147 - 149
[3] ON GENERALIZED DT0L SYSTEMS AND THEIR FIXED-POINTS
HONKALA, J
THEORETICAL COMPUTER SCIENCE, 1994, 127 (02) : 269 - 286
[4] On images of D0L and DT0L power series
Honkala, J
THEORETICAL COMPUTER SCIENCE, 2003, 290 (03) : 1869 - 1882
[5] ON A BOUND FOR THE D0L SEQUENCE EQUIVALENCE PROBLEM
EHRENFEUCHT, A
ROZENBERG, G
THEORETICAL COMPUTER SCIENCE, 1980, 12 (03) : 339 - 342
[6] THE SEQUENCE EQUIVALENCE PROBLEM IS DECIDABLE FOR 0S SYSTEMS
EHRENFEUCHT, A
ROZENBERG, G
JOURNAL OF THE ACM, 1980, 27 (04) : 656 - 663
[7] A new bound for the D0L sequence equivalence problem
Juha Honkala
Acta Informatica, 2007, 43 : 419 - 429
[8] A short solution for the HDT0L sequence equivalence problem
Honkala, J
THEORETICAL COMPUTER SCIENCE, 2000, 244 (1-2) : 267 - 270
[9] THE ULTIMATE EQUIVALENCE PROBLEM FOR UNIFORM HDT0L SYSTEMS
Salomaa, Arto
Honkala, Juha
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2006, (90): : 127 - 130
[10] A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem
J. Honkala
Theory of Computing Systems, 2001, 34 : 263 - 272

← 1 2 3 4 5 →