Some linear recurrences and their combinatorial interpretation by means of regular languages
From MaRDI portal
Publication:5941096
DOI10.1016/S0304-3975(00)00398-4zbMath0974.68101MaRDI QIDQ5941096
Elena Barcucci, Simone Rinaldi
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
A history and a survey of lattice path enumeration, Bijections and the Riordan group, Moments, Narayana numbers, and the cut and paste for lattice paths
Uses Software
Cites Work
- Unnamed Item
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- The number of Baxter permutations
- Bijective recurrences concerning Schröder paths
- A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\)
- A combinatorial interpretation of the area of Schröder paths
- Systems of Numeration
- ECO:a methodology for the enumeration of combinatorial objects