The Critical Exponent is Computable for Automatic Sequences (Q2789533): Difference between revisions

From MaRDI portal
Merged Item from Q2841972
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the expansion of some exponential periods in an integer base / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics for<i>β</i>-shifts and Diophantine approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine properties of real numbers generated by finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity, repetitions, and orbits of an automatic sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial powers of Sturmian sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Morphic and automatic words: maximal blocks and Diophantine approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the base-dependence of sets of numbers recognizable by finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform tag sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On critical exponents in fixed points of non-erasing morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every real number greater than 1 is a critical exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: H-bounded and semi-discrete languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thin and slender languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numeration systems, linear recurrences, and regular sets / rank
 
Normal rank

Latest revision as of 17:18, 6 July 2024

scientific article; zbMATH DE number 6192821
  • THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES
Language Label Description Also known as
English
The Critical Exponent is Computable for Automatic Sequences
scientific article; zbMATH DE number 6192821
  • THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES

Statements

The Critical Exponent is Computable for Automatic Sequences (English)
0 references
THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES (English)
0 references
1 March 2016
0 references
30 July 2013
0 references
0 references
0 references
automatic sequence
0 references
critical exponent
0 references
Diophantine exponent
0 references
rational number
0 references
decision procedure
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references