Context-free grammars, differential operators and formal power series
- 1 August 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 117 (1-2) , 113-129
- https://doi.org/10.1016/0304-3975(93)90307-f
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Lattice path enumeration by formal schemaAdvances in Applied Mathematics, 1992
- A general bijective algorithm for trees.Proceedings of the National Academy of Sciences, 1990
- Algebraic languages and polyominoes enumerationTheoretical Computer Science, 1984
- Une théorie combinatoire des séries formellesAdvances in Mathematics, 1981
- A factorization for formal laurent series and lattice path enumerationJournal of Combinatorial Theory, Series A, 1980
- Coalgebras and Bialgebras in CombinatoricsStudies in Applied Mathematics, 1979
- FORMAL LANGUAGES AND ENUMERATION IIAnnals of the New York Academy of Sciences, 1979
- Formal languages and enumerationJournal of Combinatorial Theory, Series A, 1978
- Formulae for high derivatives of composite functionsMathematical Proceedings of the Cambridge Philosophical Society, 1978
- Successive Derivatives of a Function of Several Functions.Annals of Mathematics, 1926