The following pages link to Anna E. Frid (Q1750220):
Displayed 50 items.
- (Q226469) (redirect page) (← links)
- On palindromic factorization of words (Q394756) (← links)
- On possible growths of Toeplitz languages (Q536628) (← links)
- Sequences of linear arithmetical complexity (Q557917) (← links)
- On highly palindromic words: the ternary case (Q777417) (← links)
- Weighted prefix normal words: mind the gap (Q832931) (← links)
- Fine and Wilf's theorem for permutations (Q890931) (← links)
- Arithmetical complexity of symmetric D0L words. (Q1426472) (← links)
- Fixed points of Sturmian morphisms and their derivated words (Q1659979) (← links)
- Sturmian numeration systems and decompositions to palindromes (Q1750221) (← links)
- On longest palindromic subwords of finite binary words (Q2037574) (← links)
- Palindromic length of words with many periodic palindromes (Q2040420) (← links)
- On a theorem concerning partially overlapping subpalindromes of a binary word (Q2070082) (← links)
- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations (Q2077272) (← links)
- On balanced sequences and their critical exponent (Q2098168) (← links)
- Equations over the \(k\)-binomial monoids (Q2140471) (← links)
- Prefix palindromic length of the Sierpinski word (Q2163982) (← links)
- Avoidance of split overlaps (Q2214038) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
- On prefix palindromic length of automatic words (Q2235743) (← links)
- Simple equations on binary factorial languages (Q2271433) (← links)
- Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words (Q2272382) (← links)
- A note about words which coincide except in one position (Q2272406) (← links)
- Morphic words and equidistributed sequences (Q2283040) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Aperiodic two-dimensional words of small abelian complexity (Q2327230) (← links)
- First lower bounds for palindromic length (Q2327559) (← links)
- Repetitions in infinite palindrome-rich words (Q2333034) (← links)
- On the arithmetical complexity of Sturmian words (Q2373754) (← links)
- Minimal complexity of equidistributed infinite permutations (Q2400969) (← links)
- The number of valid factorizations of Fibonacci prefixes (Q2419114) (← links)
- Palindromic length of words and morphisms in class \(\mathcal{P}\) (Q2420618) (← links)
- On generalized Lyndon words (Q2422029) (← links)
- On periodicity and low complexity of infinite permutations (Q2461768) (← links)
- Canonical decomposition of catenation of factorial languages (Q2466979) (← links)
- A lower bound for the arithmetical complexity of Sturmian words (Q2498100) (← links)
- On Sturmian substitutions closed under derivation (Q2663049) (← links)
- Prefixes of the Fibonacci word that end with a cube (Q2681077) (← links)
- (Q2768453) (← links)
- Infinite permutations vs. infinite words (Q2789508) (← links)
- On automatic infinite permutations (Q2911428) (← links)
- Subword Complexity and Decomposition of the Set of Factors (Q2922010) (← links)
- (Q3150246) (← links)
- Cost and dimension of words of zero topological entropy (Q3299253) (← links)
- On possible growths of arithmetical complexity (Q3421906) (← links)
- Sequences of low arithmetical complexity (Q3423138) (← links)
- Canonical Decomposition of a Regular Factorial Language (Q3434678) (← links)
- Canonical Representatives of Morphic Permutations (Q3449357) (← links)
- (Q3576702) (← links)
- (Q3836532) (← links)