Numeration systems on a regular language
From MaRDI portal
Publication:5929087
DOI10.1007/s002240010014zbMath0969.68095OpenAlexW1990014377MaRDI QIDQ5929087
Michel Rigo, Pierre B. A. Lecomte
Publication date: 17 April 2001
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240010014
Related Items (40)
Decidability questions related to abstract numeration systems ⋮ Dynamical directions in numeration ⋮ Substitutions, abstract number systems and the space filling property ⋮ Surminimisation of Automata ⋮ A numeration system for Fibonacci-like Wang shifts ⋮ Syndeticity and independent substitutions ⋮ Multi-dimensional sets recognizable in all abstract numeration systems ⋮ On the Recognizability of Self-generating Sets ⋮ Abstract \(\beta\)-expansions and ultimately periodic representations ⋮ Ultimate periodicity problem for linear numeration systems ⋮ Real numbers having ultimately periodic representations in abstract numeration systems ⋮ Discrepancy Bounds for β $$\boldsymbol{\beta }$$ -adic Halton Sequences ⋮ Automatic winning shifts ⋮ Two-dimensional Fibonacci words: tandem repeats and factor complexity ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ String Attractors of Fixed Points of k-Bonacci-Like Morphisms ⋮ The carry propagation of the successor function ⋮ First-Order Logic and Numeration Systems ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Trees and languages with periodic signature ⋮ Counting the number of non-zero coefficients in rows of generalized Pascal triangles ⋮ Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts ⋮ Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions ⋮ Multidimensional generalized automatic sequences and shape-symmetric morphic words ⋮ Self-generating sets, integers with missing blocks, and substitutions ⋮ Representing real numbers in a generalized numeration system ⋮ Radix enumeration of rational languages ⋮ A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems ⋮ A Characterization of Multidimensional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>S</mml:mi></mml:math>-Automatic Sequences ⋮ The growth function of \(S\)-recognizable sets ⋮ Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series ⋮ The signature of rational languages ⋮ Combinatorial and probabilistic properties of systems of numeration ⋮ A Probabilistic Approach to Generalized Zeckendorf Decompositions ⋮ Decimations of languages and state complexity ⋮ About frequencies of letters in generalized automatic sequences ⋮ A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS ⋮ Revisiting regular sequences in light of rational base numeration systems ⋮ Regular sequences and synchronized sequences in abstract numeration systems ⋮ Generalization of automatic sequences for numeration systems on a regular language
This page was built for publication: Numeration systems on a regular language
