Pattern avoiding languages and recurrence relations interpretation

DOI10.3233/FI-2017-1595zbMATH Open1386.68086MaRDI QIDQ4606259FDOQ4606259

Authors: Elisabetta Grazzini, E. Pergola, S. Bilotta 

Publication date: 2 March 2018

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

pattern avoidancecross-bifix-free setslinear recurrence relationssuccession rules

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Some linear recurrences and their combinatorial interpretation by means of regular languages
• A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\)
• Recursive Functions with Pattern Matching in Interaction Nets

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)