ON TWO-DIMENSIONAL PATTERN-MATCHING LANGUAGES AND THEIR DECISION-PROBLEMS

被引：1

作者：

MORITA, K ^{[1
]}

NAKAZONO, K ^{[1
]}

SUGATA, K ^{[1
]}

机构：

[1] NIPPON TELEGRAPH & TEL PUBL CORP, MUSASHINO ELECT COMMUN LAB, BASIC RES LABS, MUSASHINO, TOKYO 180, JAPAN

来源：

INFORMATION SCIENCES | 1986年 / 40卷 / 01期

关键词：

PATTERN RECOGNITION;

D O I：

10.1016/0020-0255(86)90012-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose two new classes of two-dimensional array languages, called existential matching languages (EXMLs) and universal matching languages (UNMLs). These languages are closely related to two-dimensional pattern matching, and thus suited for studying them formally. In this paper, basic properties of these languages and decidability (or undecidability) of several problems about them are investigated. We show that, because of the two-dimensionality, several decision problems, such as the emptiness problem for UNMLs, the universe problem for EXMLs, and the equivalence problems for both languages, are undecidable. Thus we cannot decide, for example, whether two-dimensional pattern-matching tasks are equivalent.

引用

页码：53 / 66

页数：14

共 50 条

[41] FAST ALGORITHMS FOR 2-DIMENSIONAL AND MULTIPLE PATTERN-MATCHING
BAEZAYATES, R
REGNIER, M
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 447 : 332 - 347
[42] THE DESIGN OF EFFICIENT ALGORITHMS FOR 2-DIMENSIONAL PATTERN-MATCHING
FAN, JJ
SU, KY
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1995, 7 (02) : 318 - 327
[43] ON 2-DIMENSIONAL PATTERN-MATCHING BY OPTIMAL PARALLEL ALGORITHMS
CROCHEMORE, M
RYTTER, W
THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) : 403 - 414
[44] A SHEAF-THEORETIC APPROACH TO PATTERN-MATCHING AND RELATED PROBLEMS
SRINIVAS, YV
THEORETICAL COMPUTER SCIENCE, 1993, 112 (01) : 53 - 97
[45] Template-Based Pattern Matching in Two-Dimensional Arrays
Han, Yo-Sub
Prusa, Daniel
COMBINATORIAL IMAGE ANALYSIS, IWCIA 2017, 2017, 10256 : 79 - 92
[46] On the complexity of pattern matching for highly compressed two-dimensional texts
Berman, P
Karpinski, M
Larmore, LL
Plandowski, W
Rytter, W
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 65 (02) : 332 - 350
[47] On the complexity of pattern matching for highly compressed two-dimensional texts
Berman, P
Karpinski, M
Larmore, LL
Plandowski, W
Rytter, W
COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 1997, 1264 : 40 - 51
[48] A new approach to two-dimensional pattern matching allowing errors
Sang, ZQ
Ding, MY
Zhang, TX
1997 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT PROCESSING SYSTEMS, VOLS 1 & 2, 1997, : 1009 - 1013
[49] Point pattern matching in the analysis of two-dimensional gel electropherograms
Pánek, J
Vohradsky, J
ELECTROPHORESIS, 1999, 20 (18) : 3483 - 3491
[50] ON THE EXISTENCE OF THE MINIMUM ASYNCHRONOUS AUTOMATON AND ON DECISION-PROBLEMS FOR UNAMBIGUOUS REGULAR TRACE LANGUAGES
BRUSCHI, D
PIGHIZZINI, G
SABADINI, N
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 294 : 334 - 345

← 1 2 3 4 5 →