Back to search

University of Waterloo

Proving Properties of Fibonacci Representations via Automata Theory

Abstract

dc:description.abstract

In this work, we introduce a novel framework for mechanically testing the completeness and unambiguity of Fibonacci-based representations via automata theory. We call a representation (or a number system) complete and unambiguous when it provides one and only one representation for each number in the range covered by the representation. Many commonly used representations are complete and unambiguous: consider the familiar binary number system—each natural number has a unique representation up to leading zeros. Additionally, if a representation is complete, we describe an algorithm, of O(log n) complexity, to find a representation for any particular number n.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Shan, Sonja Linghui
Advisor dc:contributor.advisor
  • Shallit, Jeffrey

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/20258

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Shan, Sonja Linghui. Proving Properties of Fibonacci Representations via Automata Theory. University of Waterloo, 2024. http://hdl.handle.net/10012/20258