Combinatorical and Algebraic Structures Seminar
Session details
| Date: | 3.12.2019 |
| Speaker: | Hynek Peřina, FJFI, České vysoké učení technické v Praze |
| Title: | Normalisation in Linear Recurrent Numeration Systems |
| Abstract: | B-systems are a generalisation of the standard numeration system, where instead of a geometric sequence, we use a homogeneous linearly recurrent sequence to represent integers. Normalisation is the process where a word $w$ is converted to a greedy (normal) representation $\langle w\rangle$ that represents the same value as $w$. We will show two methods of normalisation in such systems. The first one relies on the construction of a finite transducer, with great similarity to normalisation in systems with real base. The second one consists of iteratively moving across the set of words with the same numerical value until the greedy representation is reached. |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož