A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Analytic aspects of the shuffle product
2008
Symposium on Theoretical Aspects of Computer Science
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the search to understand how to extend these natural correspondences, we find that the shuffle product models many key aspects of D-finite generating functions, a class which contains algebraic. We consider several different takes on the shuffle product, shuffle closure, and shuffle grammars, and give explicit generating
doi:10.4230/lipics.stacs.2008.1317
dblp:conf/stacs/MishnaZ08
fatcat:mirxwjsyzjeetidybchfkg4bmq