Pattern avoiding languages and recurrence relations interpretation

DOI10.3233/FI-2017-1595MaRDI QIDQ4606259zbMATH OpenFDO

Authors Elisabetta Grazzini, E. Pergola, S. Bilotta

Publication date 2 March 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2017-1595

zbMATH Keywords

cross-bifix-free setslinear recurrence relationspattern avoidancesuccession rules

Mathematics Subject Classification ID

Recurrences (11B37) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Some linear recurrences and their combinatorial interpretation by means of regular languages
• scientific article; zbMATH DE number 5557896
• Algebraic generating functions for languages avoiding Riordan patterns
• A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\)
• Multiple pattern interpretations

Cited in

(4)

• A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\)
• scientific article; zbMATH DE number 1234886 (Why is no real title available?)
• Recursive Functions with Pattern Matching in Interaction Nets
• Some linear recurrences and their combinatorial interpretation by means of regular languages

This page was built for publication: Pattern avoiding languages and recurrence relations interpretation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606259)