Abstract numeration systems on bounded languages and multiplication by a constant

zbMATH Open1210.68066MaRDI QIDQ3628993FDOQ3628993

Authors: Émilie Charlier, Wolfgang Steiner, Michel Rigo 

Publication date: 26 May 2009

Full work available at URL: https://eudml.org/doc/117383

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• On the recognizability of self-generating sets
• The growth function of \(S\)-recognizable sets
• Decimations of languages and state complexity
• First-order logic and numeration systems
• Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
• From combinatorial games to shape-symmetric morphisms
• 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)