Please use this identifier to cite or link to this item:
|Title:||Partial Derivative Automaton for Regular Expressions with Shuffle|
|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. © Springer International Publishing Switzerland 2015.|
|Source:||Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings|
|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.