LIPIcs.STACS.2008.1317.pdf
- Filesize: 175 kB
- 12 pages
Document
Analytic aspects of the shuffle product
Authors
-
Part of:
Volume:
25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2008-02-06
Cite AsGet BibTex
Marni Mishna and Mike Zabrocki. Analytic aspects of the shuffle product. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 561-572, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/LIPIcs.STACS.2008.1317
https://doi.org/10.4230/LIPIcs.STACS.2008.1317
Abstract
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.
Keywords
- Generating functions
- formal languages
- shuffle product
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads