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 条

[31] ON THE EQUIVALENCE PROBLEM FOR REGULAR THUE SYSTEMS
NARENDRAN, P
THEORETICAL COMPUTER SCIENCE, 1986, 44 (02) : 237 - 245
[32] ULTIMATE EQUIVALENCE PROBLEM FOR DOL SYSTEMS
CULIK, K
ACTA INFORMATICA, 1978, 10 (01) : 79 - 84
[33] ON THE EQUIVALENCE PROBLEM FOR BINARY DOL SYSTEMS
KARHUMAKI, J
INFORMATION AND CONTROL, 1981, 50 (03): : 276 - 284
[34] Restricted Equivalence Function on L([0,1])
Palmeira, Eduardo S.
Bedregal, Benjamin
FUZZY LOGIC IN INTELLIGENT SYSTEM DESIGN: THEORY AND APPLICATIONS, 2018, 648 : 410 - 420
[35] Decidability of EDT0L structural equivalence
Salomaa, K
Yu, S
THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) : 245 - 259
[36] STRUCTURE OF THE REACHABILITY PROBLEM FOR (0,1)-CAPACITATED MARKED GRAPHS
THULASIRAMAN, K
COMEAU, MA
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1987, 34 (03): : 317 - 319
[37] A polynomial bound for certain cases of the DOL sequence equivalence problem
Honkala, J
THEORY OF COMPUTING SYSTEMS, 2001, 34 (03) : 263 - 272
[38] ON THE EQUIVALENCE PROBLEM AND INTEGRATION OF DIFFERENTIAL-SYSTEMS
HIGA, T
NAGOYA MATHEMATICAL JOURNAL, 1987, 106 : 49 - 77
[39] A bound for the ω-equivalence problem of polynomial dol systems
Honkala, J
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2003, 37 (02): : 149 - 157
[40] DECIDABILITY OF EQUIVALENCE PROBLEM FOR DOL-SYSTEMS
CULIK, K
FRIS, I
INFORMATION AND CONTROL, 1977, 35 (01): : 20 - 39

← 1 2 3 4 5 →