Strings from linear recurrences: a Gray code

DOI10.1007/978-3-030-85088-3_4MaRDI QIDQ2140458zbMATH OpenOpenAlexFDO

Authors Elena Barcucci, Antonio Bernini, R. Pinzani

Publication date 20 May 2022

Full work available at URL https://doi.org/10.1007/978-3-030-85088-3_4

zbMATH Keywords

regular languagenumeration systemgray code

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Gray code orders for \(q\)-ary words avoiding a given factor
• Some linear recurrences and their combinatorial interpretation by means of regular languages
• Systems of Numeration

Cited in

(2)

• Restricting Dyck paths and 312-avoiding permutations
• Strings from linear recurrences and permutations: a gray code

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Strings from linear recurrences: a Gray code

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