ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES (Q4902892): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Palindromic continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindrome complexity. / 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: 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: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exercise on Fibonacci Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squares and overlaps in the Thue-Morse sequence and some variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bertrand numeration systems and recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE REPETITIVITY INDEX OF INFINITE WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factors of synchronized sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On synchronized sequences and their separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform tag sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographically least words in the orbit closure of the Rudin-Shapiro word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Periods of Factors of Infinite Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the factors of automatic words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators in infinite words generated by morphisms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Periodicity of Morphic Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision method for the recognizability of sets defined by number systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stern polynomials / 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: Reconnaissabilité des substitutions et complexité des suites automatiques / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON UNIFORMLY RECURRENT MORPHIC SEQUENCES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Theorem of R. Jungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation complexity of the Thue-Morse word / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054112400448 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2570053645 / rank
 
Normal rank

Latest revision as of 09:53, 30 July 2024

scientific article; zbMATH DE number 6126738
Language Label Description Also known as
English
ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
scientific article; zbMATH DE number 6126738

    Statements

    ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES (English)
    0 references
    0 references
    0 references
    0 references
    18 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    \(k\)-automatic sequence
    0 references
    \(k\)-regular sequence
    0 references
    decidability
    0 references
    enumeration
    0 references
    automata
    0 references
    unbordered word
    0 references
    subword complexity
    0 references
    appearance function
    0 references
    recurrence
    0 references
    0 references