Pm numbers, ambiguity, and regularity
| dc.contributor.author | Cameron, Helen | |
| dc.contributor.author | Wood, Derek | |
| dc.date.accessioned | 2026-07-28T18:06:39Z | |
| dc.date.issued | 1991-09 | |
| dc.description.abstract | We introduce the pseudo-m-ary (Pm) number system in which numbers are represented by sums of the form Zi>oai(mi+1=1). We characterize the Pm representations that are produced by the greedy algorithm and show that they form a regular set. In addition, we show that the set of Pm representations that are the sole representations for their corresponding numbers is also a regular set. | |
| dc.identifier.uri | https://hdl.handle.net/10012/23857 | |
| dc.language.iso | en | |
| dc.publisher | University of Waterloo | |
| dc.relation.ispartofseries | Computer Science Technical Reports; CS-91-47 | |
| dc.title | Pm numbers, ambiguity, and regularity | |
| dc.type | Technical Report | |
| uws.contributor.affiliation1 | Faculty of Mathematics | |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | |
| uws.peerReviewStatus | Unreviewed | |
| uws.scholarLevel | Faculty | |
| uws.typeOfResource | Text | en |