Results 11 to 20 of about 2,209 (285)
Non-Standard Numeration Systems
Acta Polytechnica, 2005 We study some properties of non-standard numeration systems with an irrational base ß >1, based on the so-called beta-expansions of real numbers [1]. We discuss two important properties of these systems, namely the Finiteness property, stating whether ...
P. Ambrož
doaj +3 more sources
Tilings Generated by Ito-Sadahiro and Balanced (-ß)-numeration Systems
Acta Polytechnica, 2010 Let β > 1 be a cubic Pisot unit. We study forms of Thurston tilings arising from the classical β-numeration system and from the (−β)-numeration system for both the Ito-Sadahiro and balanced definition of the (−β)-transformation.
P. Ambrož
doaj +3 more sources
Confluent linear numeration systems
Theoretical Computer Science, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frougny, Christiane
openaire +3 more sources
State Complexity of Testing Divisibility [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems.
Emilie Charlier +3 more
doaj +1 more source
Numeration Systems on a Regular Language [PDF]
Theory of Computing Systems, 2000 Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable.
Lecomte, Pierre, Rigo, Michel
openaire +4 more sources
Automatic sequences based on Parry or Bertrand numeration systems [PDF]
, 2019 peer reviewedWe study the factor complexity and closure properties of automatic sequences based on Parry or Bertrand numeration systems. These automatic sequences can be viewed as generalizations of the more typical k-automatic sequences and Pisot ...
Jarkko Peltomäki +5 more
core +5 more sources
On subtrees of the representation tree in rational base numeration systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the set of the representations of integers.
Shigeki Akiyama +2 more
doaj +1 more source
Journal of Automated Reasoning, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Circular words and applications [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular words, then mention possible applications to various situations: periodic ...
Benoît Rittaud, Laurent Vivier
doaj +1 more source
Modeling the travel distances of debris flows and debris slides: quantifying hillside morphology [PDF]
Annals of Forest Research, 2011 A travel distance model for debris flows and slides is presented based on information collected in southeast British Columbia, Canada. The model incorporates a variable that represents terrain morphology by a single number, quantification made using a ...
Bogdan Strimbu
doaj +3 more sources