Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs

DOI10.7561/SACS.2014.1.137zbMath1424.05151arXiv1310.2449OpenAlexW2963737578MaRDI QIDQ4621179

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

Publication date: 8 February 2019

Published in: Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.2449

zbMATH Keywords

generating functionscontinued fractionslattice pathsenumerative combinatoricsinfinite weighted automata

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Enumeration in graph theory (05C30) Paths and cycles (05C38) Continued fractions (11A55) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (4)

A refinement of Dyck paths: A combinatorial approach ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs