Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs
Discrete Mathematics
2013-12-30 v2 Formal Languages and Automata Theory
Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.1310.2449,
title = {Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs},
author = {Rodrigo De Castro and Andrés L. Ramírez and José L. Ramírez},
journal= {arXiv preprint arXiv:1310.2449},
year = {2013}
}