Properties and limits of recognition of sets of integers by countable automata (Q628831): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Diophantine properties of real numbers generated by finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ring of \(k\)-regular sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ring of \(k\)-regular sequences. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679727 / 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 the regular structure of prefix rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite transition graphs having a decidable monadic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution dynamical systems on infinite alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integers with an average sum of digits / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CONTEXT-FREENESS OF THE θ-EXPANSIONS OF THE INTEGERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Recognition of Primes by Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of infinite words generated by countable \(q\)-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drunken man infinite words complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetics properties of substitutions and infinite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrecognizable Sets of Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of automatic sequences for numeration systems on a regular language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata and the Set of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark on Acceptable Sets of Numbers / rank
 
Normal rank

Latest revision as of 20:45, 3 July 2024

scientific article
Language Label Description Also known as
English
Properties and limits of recognition of sets of integers by countable automata
scientific article

    Statements

    Properties and limits of recognition of sets of integers by countable automata (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2011
    0 references
    0 references
    sets of integers
    0 references
    countable automata
    0 references
    \(k\)-recognizable sets
    0 references
    0 references