Partial Derivative Automaton for Regular Expressions with Shuffle
Formal Languages and Automata Theory
2015-03-03 v1
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 2^m, where m is the number of letters in the expression, while asymptotically and on average it is no more than (4/3)^m.
Keywords
Cite
@article{arxiv.1503.00279,
title = {Partial Derivative Automaton for Regular Expressions with Shuffle},
author = {Sabine Broda and António Machiavelo and Nelma Moreira and Rogério Reis},
journal= {arXiv preprint arXiv:1503.00279},
year = {2015}
}