Automatic Sets of Rational Numbers (Q2947958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An analogue of Cobham’s theorem for fractals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Cobham's theorem to automata over real numbers / 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: Sets of Numbers Defined by Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability and decision problems in arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Critical Exponent is Computable for Automatic Sequences / rank
 
Normal rank

Latest revision as of 20:43, 10 July 2024

scientific article
Language Label Description Also known as
English
Automatic Sets of Rational Numbers
scientific article

    Statements

    Identifiers