-
64浏览
-
0点赞
-
0收藏
-
0分享
-
154下载
-
0评论
-
引用
期刊论文
Cpmtext-free grammars, differential operators and formal power series
Theoretical Computer Science 117(1993)113-129,-0001,():
In this paper, we introduce the concepts of a formal function over an alphabet and a formal derivative based on a set of substituion rules. We call such a set of rules a context-free grammar because these rules act like a context-free grammar in the sense of a formal language. Given a context-free grammar, we can associate each formal function with an exponential formal power series. In this way, we obtain grammatical interpretations of addition, multiplication and functional composition of formal power series. A surprising fact about the grammatical calculus is that the composition of two formal power series enjoys a very simple grammatical representation. We apply this method to obtain simple demonstrations of Faa di Bruno's formula, and some identities concerning Bell polynomials, Stirling numbers and symmetric functions. In particular, the Lagrange inversion formula has a simple grammatical representation. From this point of view, one sees that Cayley's formula on labeled trees is equivalent to the Lagrange inversion formula.
【免责声明】以下全部内容由[陈永川]上传于[2005年03月03日 21时14分07秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果