Abstract numeration systems

DOI10.1017/CBO9780511777653.004zbMath1216.68147OpenAlexW2487809102MaRDI QIDQ5393497

Pierre B. A. Lecomte, Michel Rigo

Publication date: 18 April 2011

Published in: Combinatorics, Automata and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/cbo9780511777653.004

zbMATH Keywords

regular languagesrepresentation of integerscomplexity functionCobham's theoremformal language theoryabstract numeration systemsinfinite automatic wordsstability of recognisability

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Automata sequences (11B85) Other number representations (11A67)

Related Items (9)

Surminimisation of Automata ⋮ Multi-dimensional sets recognizable in all abstract numeration systems ⋮ Unnamed Item ⋮ Automatic sequences: from rational bases to trees ⋮ The carry propagation of the successor function ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Trees and languages with periodic signature ⋮ The signature of rational languages ⋮ Unnamed Item

This page was built for publication: Abstract numeration systems