Some linear recurrences and their combinatorial interpretation by means of regular languages

DOI10.1016/S0304-3975(00)00398-4zbMath0974.68101OpenAlexW2022623598MaRDI QIDQ5941096

Simone Rinaldi, Elena Barcucci

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00398-4

zbMATH Keywords

numeration systemslinear recurrence relationsregular languagessuccession rules

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Bijections and the Riordan group ⋮ Strings from linear recurrences: a Gray code ⋮ Recurrence relations, succession rules and the positivity problem ⋮ A history and a survey of lattice path enumeration ⋮ Moments, Narayana numbers, and the cut and paste for lattice paths ⋮ Strings from linear recurrences and permutations: a gray code

Uses Software

• OEIS

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

This page was built for publication: Some linear recurrences and their combinatorial interpretation by means of regular languages