Pages that link to "Item:Q1391295"

The following pages link to Bertrand numeration systems and recognizability (Q1391295):

Displaying 35 items.

• Deciding game invariance (Q515578) (← links)
• Real numbers having ultimately periodic representations in abstract numeration systems (Q598243) (← links)
• Redundancy of minimal weight expansions in Pisot bases (Q653321) (← links)
• Automatic maps in exotic numeration systems (Q679441) (← links)
• Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions (Q965231) (← links)
• Self-similar tiling systems, topological factors and stretching factors (Q1006395) (← links)
• Some fascinating integer sequences (Q1199616) (← links)
• On recognizable sets of integers (Q1273179) (← links)
• Independent numeration systems and syndeticity (Q1275464) (← links)
• Generalization of automatic sequences for numeration systems on a regular language (Q1575724) (← links)
• Ostrowski numeration systems, addition, and finite automata (Q1750300) (← links)
• Decidability questions related to abstract numeration systems (Q1877679) (← links)
• Additive number theory via automata theory (Q1987517) (← links)
• Automatic sequences based on Parry or Bertrand numeration systems (Q2002037) (← links)
• Robustness of Pisot-regular sequences (Q2020014) (← links)
• Minimal automaton for multiplying and translating the Thue-Morse set (Q2040011) (← links)
• Regular sequences and synchronized sequences in abstract numeration systems (Q2066012) (← links)
• A full characterization of Bertrand numeration systems (Q2163984) (← links)
• Syndeticity and independent substitutions (Q2377960) (← links)
• Abstract \(\beta\)-expansions and ultimately periodic representations (Q2388623) (← links)
• Decision algorithms for Fibonacci-automatic Words, I: Basic results (Q3186674) (← links)
• Mechanical Proofs of Properties of the Tribonacci Word (Q3449367) (← links)
• A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS (Q3643584) (← links)
• First-Order Logic and Numeration Systems (Q4613547) (← links)
• On multiplicatively dependent linear numeration systems, and periodic points (Q4800260) (← links)
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES (Q4902892) (← links)
• An extension of the Cobham-Semënov Theorem (Q4953215) (← links)
• (Q5020521) (← links)
• Ultimate periodicity problem for linear numeration systems (Q5075706) (← links)
• From Combinatorial Games to Shape-Symmetric Morphisms (Q5141334) (← links)
• (Q5155673) (← links)
• Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series (Q5958624) (← links)
• Properties of a ternary infinite word (Q6041042) (← links)
• Automatic sequences: from rational bases to trees (Q6045415) (← links)