Revisiting regular sequences in light of rational base numeration systems

DOI10.1016/j.disc.2021.112735OpenAlexW3217447341MaRDI QIDQ2065907

Manon Stipulanti, Michel Rigo

Publication date: 13 January 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.16966

zbMATH Keywords

linear representationskernelsregular sequencesabstract numeration systemsdecorated linear treesrational base numeration systems

Mathematics Subject Classification ID

Theory of computing (68Qxx) Sequences and sets (11Bxx) Discrete mathematics in relation to computer science (68Rxx)

Uses Software

• OEIS
• IntegerSequences

Cites Work

• Unnamed Item
• Unnamed Item
• Trees and languages with periodic signature
• Counting the number of non-zero coefficients in rows of generalized Pascal triangles
• Powers of rationals modulo 1 and rational base number systems
• Recognizable formal power series on trees
• The ring of \(k\)-regular sequences
• The ring of \(k\)-regular sequences. II.
• Regular sequences and synchronized sequences in abstract numeration systems
• Avoiding 5/4-powers on the alphabet of nonnegative integers
• WHAT IS...an Automatic Sequence?
• Breadth-First Serialisation of Trees and Rational Languages
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Attractors of directed graph IFSs that are not standard IFS attractors and their Hausdorff measure
• Numeration systems on a regular language

This page was built for publication: Revisiting regular sequences in light of rational base numeration systems