COMBINING MATCHING ALGORITHMS - THE REGULAR CASE

被引：16
|
作者：
NIPKOW, T
机构：
[1] University of Cambridge, Computer Laboratory, Cambridge, CB2 3QG, Pembroke Street
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 1991年 / 12卷 / 06期
关键词：
D O I：
10.1016/S0747-7171(08)80145-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The problem of combining matching algorithms for equational theories with disjoint signatures is studied. It is shown that the combined matching problem is in general undecidable but that it becomes decidable if all theories are regular. For the case of regular theories an efficient combination algorithm is developed. As part of that development we present a simple algorithm for solving the word problem in the combination of arbitrary equational theories with disjoint signatures. © 1991, Academic Press Limited. All rights reserved.
引用
收藏
页码：633 / 653
页数：21
相关论文
共 50 条
  • [1] COMBINING MATCHING ALGORITHMS - THE REGULAR CASE
    NIPKOW, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 343 - 358
  • [2] New algorithms for regular expression matching
    Bille, Philip
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 643 - 654
  • [3] Ensemble Classifier for Combining Stereo Matching Algorithms
    Spyropoulos, Aristotle
    Mordohai, Philippos
    2015 INTERNATIONAL CONFERENCE ON 3D VISION, 2015, : 73 - 81
  • [4] COMBINING UNIFICATION ALGORITHMS FOR CONFINED REGULAR EQUATIONAL THEORIES
    YELICK, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 202 : 365 - 380
  • [5] Exploring efficient grouping algorithms in regular expression matching
    Xu, Chengcheng
    Su, Jinshu
    Chen, Shuhui
    PLOS ONE, 2018, 13 (10):
  • [6] Fast algorithms for extended regular expression matching and searching
    Ilie, L
    Shan, BZ
    Yu, S
    STACS 2003, PROCEEDINGS, 2003, 2607 : 179 - 190
  • [7] SAT-Based Algorithms for Regular Graph Pattern Matching
    Terra-Neves, Miguel
    Amaral, Jose
    Lemos, Alexandre
    Quintino, Rui
    Resende, Pedro
    Alegria, Antonio
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 8, 2024, : 8136 - 8145
  • [8] Overlay Automata and Algorithms for Fast and Scalable Regular Expression Matching
    Liu, Alex X.
    Torng, Eric
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (04) : 2400 - 2415
  • [9] Combining decision algorithms for matching in the union of disjoint equational theories
    Ringeissen, C
    INFORMATION AND COMPUTATION, 1996, 126 (02) : 144 - 160
  • [10] Algorithms to accelerate multiple regular expressions matching for deep packet inspection
    Kumar, Sailesh
    Dharmapurikar, Sarang
    Yu, Fang
    Crowley, Patrick
    Turner, Jonathan
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (04) : 339 - 350
12345