Position Automaton Construction for Regular Expressions with Intersection

被引：2
|
作者：
Broda, Sabine [1 ]
Machiavelo, Antonio [1 ]
Moreira, Nelma [1 ]
Reis, Rogerio [1 ]
机构：
[1] Univ Porto, Fac Ciencias, CMUP, Oporto, Portugal
来源：
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016 | 2016年 / 9840卷
关键词：
PARTIAL DERIVATIVES;
D O I：
10.1007/978-3-662-53132-7_5
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Positions and derivatives are two essential notions in the conversion methods from regular expressions to equivalent finite automata. Partial derivative based methods have recently been extended to regular expressions with intersection. In this paper, we present a position automaton construction for those expressions. This construction generalizes the notion of position making it compatible with intersection. The resulting automaton is homogeneous and has the partial derivative automaton as its quotient.
引用
收藏
页码：51 / 63
页数：13
相关论文
共 50 条
  • [1] Intersection of -ω-Regular Expressions
    A. N. Chebotarev
    Cybernetics and Systems Analysis, 2021, 57 : 676 - 684
  • [2] INTERSECTION OF -ω-REGULAR EXPRESSIONS
    Chebotarev, A. N.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2021, 57 (05) : 676 - 684
  • [3] Partial Derivative Automaton by Compressing Regular Expressions
    Konstantinidis, Stavros
    Machiavelo, Antonio
    Moreira, Nelma
    Reis, Rogerio
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2021, 2021, 13037 : 100 - 112
  • [4] Succinctness of the complement and intersection of regular expressions
    Gelade, Wouter
    Neven, Frank
    STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 325 - +
  • [5] Succinctness of the Complement and Intersection of Regular Expressions
    Gelade, Wouter
    Neven, Frank
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2012, 13 (01)
  • [6] Partial derivatives of regular expressions and finite automaton constructions
    Antimirov, V
    THEORETICAL COMPUTER SCIENCE, 1996, 155 (02) : 291 - 319
  • [7] Succinctness of regular expressions with interleaving, intersection and counting
    Gelade, Wouter
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 363 - +
  • [8] Location automata for regular expressions with shuffle and intersection
    Broda, Sabine
    Machiavelo, Antonio
    Moreira, Nelma
    Reis, Rogerio
    INFORMATION AND COMPUTATION, 2023, 295
  • [9] Succinctness of regular expressions with interleaving, intersection and counting
    Gelade, Wouter
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (31-33) : 2987 - 2998
  • [10] Fast text searching for regular expressions or automaton searching on tries
    BaezaYates, RA
    Gonnet, GH
    JOURNAL OF THE ACM, 1996, 43 (06) : 915 - 936
12345