Abstract numeration systems on bounded languages and multiplication by a constant

MaRDI QIDQ3628993zbMATH OpenFDO

Authors Émilie Charlier, Wolfgang Steiner, Michel Rigo

Publication date 26 May 2009

Full work available at URL https://eudml.org/doc/117383, http://www.emis.de/journals/INTEGERS/papers/i35/i35.Abstract.html

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
• Multi-dimensional sets recognizable in all abstract numeration systems
• Abstract numeration systems
• scientific article; zbMATH DE number 1929973
• Numeration systems on a regular language

Cited in

(9)

• From combinatorial games to shape-symmetric morphisms
• On the recognizability of self-generating sets
• Decimations of languages and state complexity
• The growth function of \(S\)-recognizable sets
• Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
• First-order logic and numeration systems
• Formal Languages, Automata and Numeration Systems 1
• Regular sequences and synchronized sequences in abstract numeration systems
• On digital sequences associated with Pascal's triangle

This page was built for publication: Abstract numeration systems on bounded languages and multiplication by a constant

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