THE SEQUENCE EQUIVALENCE PROBLEM IS DECIDABLE FOR 0S SYSTEMS

被引：1

作者：

EHRENFEUCHT, A ^{[1
]}

ROZENBERG, G ^{[1
]}

机构：

[1] UNIV LEIDEN,INST APPL MATH & COMP SCI,NL-2300 RA LEIDEN,NETHERLANDS

来源：

JOURNAL OF THE ACM | 1980年 / 27卷 / 04期

关键词：

D O I：

10.1145/322217.322222

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：656 / 663

页数：8

共 50 条

[1] THE OMEGA-SEQUENCE EQUIVALENCE PROBLEM FOR DOL SYSTEMS IS DECIDABLE
CULIK, K
HARJU, T
JOURNAL OF THE ACM, 1984, 31 (02) : 282 - 298
[2] The Sequence Equivalence Problem for Marked DT0L Systems
Honkala, Juha
FUNDAMENTA INFORMATICAE, 2011, 110 (1-4) : 175 - 182
[3] THE EQUIVALENCE PROBLEM FOR NTS LANGUAGES IS DECIDABLE
SENIZERGUES, G
LECTURE NOTES IN COMPUTER SCIENCE, 1982, 145 : 313 - 323
[4] The equivalence problem for deterministic pushdown automata is decidable
Senizergues, G
AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 671 - 681
[5] A CLASS OF MULTITAPE AUTOMATA WITH A DECIDABLE EQUIVALENCE PROBLEM
KINBER, EB
PROGRAMMING AND COMPUTER SOFTWARE, 1983, 9 (03) : 121 - 127
[6] The sequence equivalence problem for primitive DOL systems
Honkala, Juha
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2013, 79 (01) : 101 - 110
[7] ON A BOUND FOR THE D0L SEQUENCE EQUIVALENCE PROBLEM
EHRENFEUCHT, A
ROZENBERG, G
THEORETICAL COMPUTER SCIENCE, 1980, 12 (03) : 339 - 342
[8] The equivalence problem for deterministic MSO tree transducers is decidable
Engelfriet, J
Maneth, S
FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3821 : 495 - 504
[9] The equivalence problem for deterministic MSO tree transducers is decidable
Engelfriet, Joost
Maneth, Sebastian
INFORMATION PROCESSING LETTERS, 2006, 100 (05) : 206 - 212
[10] CLASS OF MULTITAPE AUTOMATA WITH A DECIDABLE EQUIVALENCE PROBLEM.
Kinber, E.B.
Programming and Computer Software (English Translation of Programmirovanie), 1983, 9 (03): : 121 - 127

← 1 2 3 4 5 →