Pages that link to "Item:Q1575724"

The following pages link to Generalization of automatic sequences for numeration systems on a regular language (Q1575724):

Displaying 13 items.

• Asymptotic properties of free monoid morphisms (Q272351) (← links)
• Properties and limits of recognition of sets of integers by countable automata (Q628831) (← links)
• The growth function of \(S\)-recognizable sets (Q719280) (← links)
• On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
• Entropy rates and finite-state dimension (Q817815) (← links)
• Multidimensional generalized automatic sequences and shape-symmetric morphic words (Q966022) (← links)
• Decimations of languages and state complexity (Q1019721) (← links)
• About frequencies of letters in generalized automatic sequences (Q1022583) (← links)
• Self-generating sets, integers with missing blocks, and substitutions (Q1773352) (← links)
• Decidability questions related to abstract numeration systems (Q1877679) (← links)
• Automatic sequences based on Parry or Bertrand numeration systems (Q2002037) (← links)
• Regular sequences and synchronized sequences in abstract numeration systems (Q2066012) (← links)
• A Characterization of Multidimensional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>S</mml:mi></mml:math>-Automatic Sequences (Q4682404) (← links)