Skip to main content
SpringerLink
Log in

Greedy Numeration Systems and Regularity

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract.

We find necessary and sufficient conditions for the regularity of greedy representations of the natural numbers. The proof relies on the periodicity properties of digit expansions with nonintegral bases.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. 2504 East Roy Street, Seattle, WA 98112, USA mijklh@accessone.com, , , , , , US

    M. Hollander

Authors
  1. M. Hollander
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received July 1995, and in final form August 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hollander, M. Greedy Numeration Systems and Regularity . Theory Comput. Systems 31, 111–133 (1998). https://doi.org/10.1007/s002240000082

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002240000082

Keywords

Search

Navigation