Analytic aspects of the shuffle product

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 function consequences. In the process, we define a grammar class that models D-finite generating functions.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Marni Mishna, Mike Zabrocki
• Keywords: Context Free Languages, CORR 2008, Education, Shuffle Product, Shuffle Product Models