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 条
  • [21] THE MATCHING POLYNOMIAL OF A REGULAR GRAPH
    BEEZER, RA
    FARRELL, EJ
    DISCRETE MATHEMATICS, 1995, 137 (1-3) : 7 - 18
  • [22] APPROXIMATE MATCHING OF REGULAR EXPRESSIONS
    MYERS, EW
    MILLER, W
    BULLETIN OF MATHEMATICAL BIOLOGY, 1989, 51 (01) : 5 - 37
  • [23] Sparse Regular Expression Matching
    Bille, Philip
    Gortz, Inge Li
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 3354 - 3375
  • [24] On the number of matching in regular graphs
    Friedland, S.
    Krop, E.
    Markstroem, K.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [25] Selective Regular Expression Matching
    Stakhanova, Natalia
    Ren, Hanli
    Ghorbani, Ali A.
    INFORMATION SECURITY, 2011, 6531 : 226 - +
  • [26] Faster Regular Expression Matching
    Bille, Philip
    Thorup, Mikkel
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 171 - +
  • [27] Combining predicate transformer semantics for effects: a case study in parsing regular languages
    Baanen, Anne
    Swierstra, Wouter
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2020, (317): : 39 - 56
  • [28] On the Use of Regular Expressions and Exact-text Matching in Computer-based Test Scoring Algorithms
    Malec, Wojciech
    CSEDU: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED EDUCATION - VOL 2, 2022, : 555 - 561
  • [29] Combining globally search for a regular expression and print matching lines with bibliographic monitoring of genomic database improves diagnosis
    Mau-Them, Frederic Tran
    Overs, Alexis
    Bruel, Ange-Line
    Duquet, Romain
    Thareau, Mylene
    Denomme-Pichon, Anne-Sophie
    Vitobello, Antonio
    Sorlin, Arthur
    Safraou, Hana
    Nambot, Sophie
    Delanne, Julian
    Moutton, Sebastien
    Racine, Caroline
    Engel, Camille
    d'Agay, Melchior De Giraud
    Lehalle, Daphne
    Goldenberg, Alice
    Willems, Marjolaine
    Coubes, Christine
    Genevieve, David
    Verloes, Alain
    Capri, Yline
    Perrin, Laurence
    Jacquemont, Marie-Line
    Lambert, Laetitia
    Lacaze, Elodie
    Thevenon, Julien
    Hana, Nadine
    Van-Gils, Julien
    Dubucs, Charlotte
    Bizaoui, Varoona
    Gerard-Blanluet, Marion
    Lespinasse, James
    Mercier, Sandra
    Guerrot, Anne-Marie
    Maystadt, Isabelle
    Tisserant, Emilie
    Faivre, Laurence
    Philippe, Christophe
    Duffourd, Yannis
    Thauvin-Robinet, Christel
    FRONTIERS IN GENETICS, 2023, 14
  • [30] COMBINING UNIFICATION ALGORITHMS
    BOUDET, A
    JOURNAL OF SYMBOLIC COMPUTATION, 1993, 16 (06) : 597 - 626
12345