Abstract
We generalize the partial derivative automaton to regular expressions with shuffle and study its size in the worst and in the average case. The number of states of the partial derivative automata is in the worst case at most 2m, where m is the number of letters in the expression, while asymptotically and on average it is no more than (4\3)m.
Cite
CITATION STYLE
Broda, S., Machiavelo, A., Moreira, N., & Reis, R. (2015). Partial derivative automaton for regular expressions with shuffle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9118, pp. 21–32). Springer Verlag. https://doi.org/10.1007/978-3-319-19225-3_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
