Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the enumerating series of an abstract numeration system (1108.5711v1)

Published 29 Aug 2011 in cs.DM and cs.FL

Abstract: It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple computation of the value of words in this system and easy constructions for the recognition of recognisable sets of numbers. It is also shown that conversely it is decidable whether an N-rational series corresponds to a rational abstract numeration system.

Citations (2)

Summary

We haven't generated a summary for this paper yet.