Numeration systems on a regular language
From MaRDI portal
Recommendations
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
- scientific article; zbMATH DE number 2210765
- Construction of regular languages and recognizability of polynomials
- Bertrand numeration systems and recognizability
- Recognizable sets of numbers in nonstandard bases
Cited in
(60)- Decimations of languages and state complexity
- About frequencies of letters in generalized automatic sequences
- Numeration systems, linear recurrences, and regular sets
- Generalization of automatic sequences for numeration systems on a regular language
- On the representation of real numbers using regular languages
- Construction of regular languages and recognizability of polynomials
- Ostrowski numeration systems, addition, and finite automata
- Self-generating sets, integers with missing blocks, and substitutions
- Decidability questions related to abstract numeration systems
- \(\beta\)-shift, numeration systems, and automata
- Revisiting regular sequences in light of rational base numeration systems
- Regular sequences and synchronized sequences in abstract numeration systems
- Regular numeral systems for data structures
- A numeration system for Fibonacci-like Wang shifts
- The carry propagation of the successor function
- Dynamical directions in numeration
- Substitutions, abstract number systems and the space filling property
- Syndeticity and independent substitutions
- Abstract \(\beta\)-expansions and ultimately periodic representations
- Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
- Automatic winning shifts
- Combinatorial and probabilistic properties of systems of numeration
- A probabilistic approach to generalized Zeckendorf decompositions
- On sets of numbers rationally represented in a rational base number system
- Multi-dimensional sets recognizable in all abstract numeration systems
- Pm numbers, ambiguity, and regularity
- scientific article; zbMATH DE number 1817672 (Why is no real title available?)
- On the Recognizability of Self-generating Sets
- Surminimisation of automata
- Numeration systems: a link between number theory and formal language theory
- A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
- Abstract numeration systems on bounded languages and multiplication by a constant
- A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
- scientific article; zbMATH DE number 1548996 (Why is no real title available?)
- Discrepancy bounds for \(\boldsymbol{\beta}\)-adic Halton sequences
- First-order logic and numeration systems
- Regularity preserving but not reflecting encodings
- A characterization of multidimensional S-automatic sequences
- ON REPRESENTATION SYSTEMS
- On String Languages Generated by Sequential Numerical P Systems
- Trees and languages with periodic signature
- Ultimate periodicity problem for linear numeration systems
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles
- From combinatorial games to shape-symmetric morphisms
- Radix enumeration of rational languages
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- scientific article; zbMATH DE number 3230267 (Why is no real title available?)
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
- Real numbers having ultimately periodic representations in abstract numeration systems
- 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
- A succinct study of positionality for Dumont-Thomas numeration systems
- Dumont-Thomas complement numeration systems for \(\mathbb{Z}\)
- Representing real numbers in a generalized numeration system
- The growth function of S-recognizable sets
- The signature of rational languages
- Odometers on regular languages
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
- Multidimensional generalized automatic sequences and shape-symmetric morphic words
This page was built for publication: Numeration systems on a regular language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929087)
