Can I read Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs on EtoBox?

Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs by De Castro, Rodrigo; Ramírez, Andrés L.; Ramírez, José L. is a scholarly article available to read on EtoBox.

What is Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs about?

In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some generalizations. These methodology uses weighted automata, equations of ordinary generating functions and continued fractions. It is a variation of the one proposed by J. Rutten.

Author

De Castro, Rodrigo; Ramírez, Andrés L.; Ramírez, José L.

Published

2013

Language

EN