Pages that link to "Item:Q5929087"
From MaRDI portal
The following pages link to Numeration systems on a regular language (Q5929087):
Displayed 40 items.
- Trees and languages with periodic signature (Q505064) (← links)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Real numbers having ultimately periodic representations in abstract numeration systems (Q598243) (← links)
- Representing real numbers in a generalized numeration system (Q716307) (← links)
- The growth function of \(S\)-recognizable sets (Q719280) (← links)
- The signature of rational languages (Q728282) (← links)
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions (Q965231) (← links)
- Multidimensional generalized automatic sequences and shape-symmetric morphic words (Q966022) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- About frequencies of letters in generalized automatic sequences (Q1022583) (← links)
- Generalization of automatic sequences for numeration systems on a regular language (Q1575724) (← links)
- Self-generating sets, integers with missing blocks, and substitutions (Q1773352) (← links)
- Decidability questions related to abstract numeration systems (Q1877679) (← links)
- Revisiting regular sequences in light of rational base numeration systems (Q2065907) (← links)
- Regular sequences and synchronized sequences in abstract numeration systems (Q2066012) (← links)
- A numeration system for Fibonacci-like Wang shifts (Q2140463) (← links)
- The carry propagation of the successor function (Q2197902) (← links)
- Dynamical directions in numeration (Q2372766) (← links)
- Substitutions, abstract number systems and the space filling property (Q2372779) (← links)
- Syndeticity and independent substitutions (Q2377960) (← links)
- Abstract \(\beta\)-expansions and ultimately periodic representations (Q2388623) (← links)
- Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts (Q2474222) (← links)
- Automatic winning shifts (Q2672264) (← links)
- Combinatorial and probabilistic properties of systems of numeration (Q2808036) (← links)
- A Probabilistic Approach to Generalized Zeckendorf Decompositions (Q2813348) (← links)
- Multi-dimensional sets recognizable in all abstract numeration systems (Q2911426) (← links)
- On the Recognizability of Self-generating Sets (Q3182952) (← links)
- Surminimisation of Automata (Q3451115) (← links)
- A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems (Q3599131) (← links)
- A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS (Q3643584) (← links)
- Discrepancy Bounds for β $$\boldsymbol{\beta }$$ -adic Halton Sequences (Q4581338) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- A Characterization of Multidimensional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>S</mml:mi></mml:math>-Automatic Sequences (Q4682404) (← links)
- Ultimate periodicity problem for linear numeration systems (Q5075706) (← links)
- From Combinatorial Games to Shape-Symmetric Morphisms (Q5141334) (← links)
- Radix enumeration of rational languages (Q5190076) (← links)
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series (Q5958624) (← links)
- Two-dimensional Fibonacci words: tandem repeats and factor complexity (Q6107832) (← links)
- On extended boundary sequences of morphic and Sturmian words (Q6117412) (← links)
- String Attractors of Fixed Points of k-Bonacci-Like Morphisms (Q6134874) (← links)