Approximating algebraic functions by means of rational ones

DOI10.1016/S0304-3975(01)00085-8zbMath0988.68122OpenAlexW2089062322MaRDI QIDQ5958324

Elisa Pergola, Renzo Pinzani, Simone Rinaldi

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00085-8

zbMATH Keywords

generating functionsapproximationalgebraic languages

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items

Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations ⋮ Production matrices ⋮ A general exhaustive generation algorithm for Gray structures ⋮ On directed-convex polyominoes in a rectangle

Cites Work

• The number of Baxter permutations
• Forbidden subsequences and Chebyshev polynomials
• Some combinatorial interpretations of \(q\)-analogs of Schröder numbers
• Generating functions for generating trees
• Generating trees and the Catalan and Schröder numbers
• ECO:a methodology for the enumeration of combinatorial objects
• On Fluctuations in Coin-Tossing
• Motzkin numbers