Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-662-53132-7_5 | DLT |
Field | DocType | Volume |
Discrete mathematics,Regular expression,Combinatorics,Nondeterministic finite automaton,Expression (mathematics),Deterministic finite automaton,Partial derivative,Reversible cellular automaton,Probabilistic automaton,Mathematics,Büchi automaton | Conference | 9840 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sabine Broda | 1 | 64 | 13.83 |
| António Machiavelo | 2 | 45 | 8.82 |
| Nelma Moreira | 3 | 180 | 33.98 |
| Rogério Reis | 4 | 140 | 25.74 |