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.
CITATION STYLE
Broda, S., Machiavelo, A., Moreira, N., & Reis, R. (2016). Position automaton construction for regular expressions with intersection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9840, pp. 51–63). Springer Verlag. https://doi.org/10.1007/978-3-662-53132-7_5
Mendeley helps you to discover research relevant for your work.