Characterizing Simpler Recognizable Sets of Integers

Authors:
Michel Rigo
Affiliations:
-
Venue:
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Year:
2002

Citing 7
Cited 0

Star-free sets of integers

Theoretical Computer Science
Formal languages

Formal languages
Bertrand numeration systems and recognizability

Theoretical Computer Science - Special issue: Latin American theoretical informatics
L systems

Handbook of formal languages, vol. 1
Automata, Languages, and Machines

Automata, Languages, and Machines
Representations lf Integers and Language Theory

Proceedings of the Mathematical Foundations of Computer Science 1984
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the k-ary numeration system, we characterize the sets of integers such that the corresponding representations make up a star-free regular language. This result can be transposed to some linear numeration systems built upon a Pisot number like the Fibonacci system and also to k-adic numeration systems. Moreover we study the problem of the base dependence of this property and obtain results which are related to Cobham's Theorem.