Please use this identifier to cite or link to this item:
|Title:||Position Automaton Construction for Regular Expressions with Intersection|
|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.|
|Source:||DEVELOPMENTS IN LANGUAGE THEORY, DLT 2016|
|Document Type:||Artigo em Livro de Atas de Conferência Internacional|
|Appears in Collections:||FCUP - Artigo em Livro de Atas de Conferência Internacional|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.