Abstract
The aim of this paper is to define a new family of regular operators fitting with the construction of the position automaton. These new operators support the computation of the four Glushkov functions (Null, First, Last and Follow), which allows the conversion of an extended expression with n symbol occurrences into a position automaton with n + 1 states. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Caron, P., Champarnaud, J. M., & Mignot, L. (2009). A new family of regular operators fitting with the position automaton computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 645–655). https://doi.org/10.1007/978-3-540-95891-8_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
