On the recognizability of self-generating sets

MaRDI QIDQ3550114zbMATH OpenFDO

Authors Tomi Kärki, Anne Lacroix, Michel Rigo

Publication date 30 March 2010

Full work available at URL https://eudml.org/doc/224179, http://www.emis.de/journals/JIS/VOL13/Rigo/rigo6.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Fibonacci wordmultiplicatively independent integersnumeration systemsrecognizabilityself-generating set

Mathematics Subject Classification ID

Automata sequences (11B85) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• On the Recognizability of Self-generating Sets
• On recognizable sets of integers
• Abstract numeration systems on bounded languages and multiplication by a constant
• Affinely self-generating sets and morphisms
• Self Generating Sets and Numeration Systems

Cited in

(7)

• m-recognizability of sets closed under certain affine functions
• On iterating linear transformations over recognizable sets of integers
• How to prove that a sequence is not automatic
• Syntactic complexity of ultimately periodic sets of integers
• On the Recognizability of Self-generating Sets
• Affinely self-generating sets and morphisms
• Combinatorics on words and generating Dirichlet series of automatic sequences

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: On the recognizability of self-generating sets

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