REWRITING EXTENDED REGULAR EXPRESSIONS

被引：15
|
作者：
ANTIMIROV, VM
MOSSES, PD
机构：
[1] AARHUS UNIV,DEPT COMP SCI,BRICS,DK-8000 AARHUS C,DENMARK
[2] INST NATL RECH INFORMAT & AUTOMAT LORRAINE,CRIN,F-54602 VILLERS LES NANCY,FRANCE
来源：
THEORETICAL COMPUTER SCIENCE | 1995年 / 143卷 / 01期
关键词：
D O I：
10.1016/0304-3975(95)80010-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn-equational axiomatization of the algebra and develop some term-rewriting techniques for constructing logical inferences of valid equations.
引用
收藏
页码：51 / 72
页数：22
相关论文
共 50 条
  • [1] Rewriting of regular expressions and regular path queries
    Calvanese, D
    De Giacomo, G
    Lenzerini, M
    Vardi, MY
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 64 (03) : 443 - 465
  • [2] On Extended Regular Expressions
    Carle, Benjamin
    Narendran, Paliath
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 279 - 289
  • [3] The effect of rewriting regular expressions on their accepting automata
    Frishert, M
    Cleophas, LG
    Watson, BW
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2003, 2759 : 304 - 305
  • [4] Modelling the semantics of calendar expressions as extended regular expressions
    Niemi, Jyrki
    Carlson, Lauri
    FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2006, 4002 : 179 - +
  • [5] Extended Regular Expressions: Succinctness and Decidability
    Freydenberger, Dominik D.
    THEORY OF COMPUTING SYSTEMS, 2013, 53 (02) : 159 - 193
  • [6] Extended Regular Expressions: Succinctness and Decidability
    Freydenberger, Dominik D.
    28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 : 507 - 518
  • [7] Extended Regular Expressions: Succinctness and Decidability
    Dominik D. Freydenberger
    Theory of Computing Systems, 2013, 53 : 159 - 193
  • [8] Testing extended regular language membership incrementally by rewriting
    Rosu, G
    Viswanathan, M
    REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2003, 2706 : 499 - 514
  • [9] EXTENDED REGULAR EXPRESSIONS OF ARBITRARY STAR DEGREES
    YOO, H
    HASHIGUCHI, K
    THEORETICAL COMPUTER SCIENCE, 1992, 97 (02) : 217 - 231
  • [10] Regenerate: A Language Generator for Extended Regular Expressions
    Radanne, Gabriel
    Thiemann, Peter
    PROCEEDINGS OF THE 17TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON GENERATIVE PROGRAMMING: CONCEPTS AND EXPERIENCES (GPCE'18), 2018, : 202 - 214
12345