Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 17 of 17 for “"numeration systems"”.

  1. Linear numeration systems without a dominant root, alternate base numeration systems, and their links.

    Numeration systems are ways of representing numbers using words. Many different systems exist, built for different purposes. Connections have been found between some of these, for instance between Rényi numeration systems and positional numeration systems with a dominant root. In this document, we …

    liege Repository record for Linear numeration systems without a dominant root, alternate base numeration systems, and their links. (opens in a new tab) Download PDF for Linear numeration systems without a dominant root, alternate base numeration systems, and their links. (opens in a new tab)

  2. Positional Numeration Systems: Ultimate Periodicity, Complexity and Automatic Sequences

    … as well as state complexity. We study positional numeration systems and recognizable sets through decision problems and automatic sequences. The first part is devoted to the following problem: given a numeration system U and a finite automaton accepting U-representations of a set X ⊆ N, can we …

    liege Repository record for Positional Numeration Systems: Ultimate Periodicity, Complexity and Automatic Sequences (opens in a new tab) Download PDF for Positional Numeration Systems: Ultimate Periodicity, Complexity and Automatic Sequences (opens in a new tab)

  3. Abstract Numeration Systems : Recognizability, Decidability, Multidimensional S-Automatic Words, and Real Numbers

    … we solve several questions regarding abstract numeration systems. Each particular problem is the focus of a chapter. The first problem concerns the study of the preservation of recognizability under multiplication by a constant in abstract numeration systems built on polynomial regular …

    liege Repository record for Abstract Numeration Systems : Recognizability, Decidability, Multidimensional S-Automatic Words, and Real Numbers (opens in a new tab) Download PDF for Abstract Numeration Systems : Recognizability, Decidability, Multidimensional S-Automatic Words, and Real Numbers (opens in a new tab)

  4. Definability and decidability for expansions of arithmetic by sets definable from positional numeration systems

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms

    uiuc Repository record for Definability and decidability for expansions of arithmetic by sets definable from positional numeration systems (opens in a new tab)

  5. An Investigation of the Role of Alternate Numeration Systems in Preservice Teacher Mathematics Content Courses

    Alternate numeration systems are common in preservice teacher (PST) mathematics curricula, but there is limited research on how to leverage alternate systems to promote the development of mathematical knowledge for teaching. I analyzed the role of alternate numeration systems in three ways. I …

    portland-state Repository record for An Investigation of the Role of Alternate Numeration Systems in Preservice Teacher Mathematics Content Courses (opens in a new tab)

  6. Systèmes de numération abstraits et combinatoire des mots (habilitation à diriger des recherches)

    We summary the main properties of abstract numeration systems and their links to combinatorics on words and combinatorial game theory.

    liege Repository record for Systèmes de numération abstraits et combinatoire des mots (habilitation à diriger des recherches) (opens in a new tab) Restricted access

  7. Decision Algorithms for Ostrowski-Automatic Sequences

    … deciding certain combinatorial and enumeration questions about such sequences that can be expressed as predicates in first-order logic. In Chapter 1, we begin with topics and ideas that are preliminary to this work, including a small introduction to non-standard positional numeration …

    waterloo Repository record for Decision Algorithms for Ostrowski-Automatic Sequences (opens in a new tab)

  8. Extensions of the Pascal Triangle to Words, and Related Counting Problems

    … of words (languages) associated with different numeration systems. We transport the existing link between the Pascal triangle and the Sierpiński gasket to this wider setting. The second part is concerned with particular sequences extracted from generalized Pascal triangles. They count non-zeroes …

    liege Repository record for Extensions of the Pascal Triangle to Words, and Related Counting Problems (opens in a new tab) Download PDF for Extensions of the Pascal Triangle to Words, and Related Counting Problems (opens in a new tab)

  9. Deciding Properties of Automatic Sequences

    … to automatic sequences, and the corresponding numeration systems. Building on that foundation, we discuss the general logical framework that formalizes the questions we can mechanically answer. We start with a first-order logical theory, and then extend it with additional predicates and …

    waterloo Repository record for Deciding Properties of Automatic Sequences (opens in a new tab)

  10. New Methods for Analyzing the Properties of Automatic Sequences

    … periodicity of factors, addition relations for numeration systems, and summation of synchronized sequences. The second part, Chapters 5 to 7, applies the previously constructed equality-of-factors predicate to investigate two central combinatorial measures of infinite words: the critical …

    waterloo Repository record for New Methods for Analyzing the Properties of Automatic Sequences (opens in a new tab)

  11. Proving Properties of Fibonacci Representations via Automata Theory

    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 …

    waterloo Repository record for Proving Properties of Fibonacci Representations via Automata Theory (opens in a new tab)

  12. The relationship between volume conservation and a volume algorithm for a rectangular parallelepiped

    … The control group (N = 30) was taught a unit on numeration systems. Four different tests were used: Volume Conservation (11 items), Volume achievement (27 items), Multiplication Achievement (20 items) and the computation section (45 items) of the Stanford Achievement Test. The pretests were: …

    ubc Repository record for The relationship between volume conservation and a volume algorithm for a rectangular parallelepiped (opens in a new tab) Download PDF for The relationship between volume conservation and a volume algorithm for a rectangular parallelepiped (opens in a new tab)

  13. Prediction of unconfined debris slide-flow travel distance using set theory

    … that exists between the binary and decimal numeration systems. The path variable uses uniform sections of the debris slide-flow, called reaches, which are larger than 25 m, except for first and last reach. Each reach can have a value 0 or 1 depending on the slope of the upstream reach. The …

    ubc Repository record for Prediction of unconfined debris slide-flow travel distance using set theory (opens in a new tab) Download PDF for Prediction of unconfined debris slide-flow travel distance using set theory (opens in a new tab)

  14. Around the Fibonacci Numeration System

    Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each subsequent number to the sum of the two previous ones. Every positive integer n can be expressed as a sum of distinct Fibonacci numbers in one or more ways. Setting R(n) to be the number of ways n can …

    unt Repository record for Around the Fibonacci Numeration System (opens in a new tab)