Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-10-26
Computer Science
Formal Languages and Automata Theory
11 pages
Scientific paper
We prove that the subsets of N^d that are S-recognizable for all abstract
numeration systems S are exactly the 1-recognizable sets. This generalizes a
result of Lecomte and Rigo in the one-dimensional setting.
Charlier Emilie
Lacroix Anne
Rampersad Narad
No associations
LandOfFree
Multi-dimensional sets recognizable in all abstract numeration systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Multi-dimensional sets recognizable in all abstract numeration systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-dimensional sets recognizable in all abstract numeration systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-159509