Pages that link to "Item:Q4298373"
From MaRDI portal
The following pages link to Computability by finite automata and pisot bases (Q4298373):
Displaying 17 items.
- On an approximation property of Pisot numbers. II (Q558196) (← links)
- Synchronized rational relations of finite and infinite words (Q685453) (← links)
- Stabilizing stationary linear discrete systems: Minimal and balanced expansions in any real base (Q1269694) (← links)
- On a property of Pisot numbers and related questions (Q1297774) (← links)
- On the dependence of numeration systems associated to the powers of a Pisot number (Q1351449) (← links)
- On-line digit set conversion in real base. (Q1853741) (← links)
- A property of Pisot numbers (Q1867444) (← links)
- Digit frequencies and Bernoulli convolutions (Q2252947) (← links)
- An analogue of Cobham's theorem for graph directed iterated function systems (Q2346036) (← links)
- On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata (Q2453381) (← links)
- Numbers with fixed sum of digits in linear recurrent number systems (Q2642506) (← links)
- Representations of numbers and finite automata (Q3992021) (← links)
- (Q4330120) (← links)
- AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION (Q4513304) (← links)
- First-Order Logic and Numeration Systems (Q4613547) (← links)
- On beta expansions for Pisot numbers (Q4878586) (← links)
- (Q5411500) (← links)