The Subword Complexity of Fixed Points of Binary Uniform Morphisms. - Anna E. Frid (FCT, 1997)

On Bispecial Words and Subword Complexity of DOL Sequences. - Anna E. Frid; Sergey V. Avgustinovich (SETA, 1998)

On Uniform DOL Words. - Anna E. Frid (STACS, 1998)

On the Frequency of Factors in a D0L Word. - Anna E. Frid (J. Autom. Lang. Comb., 1998)

Applying a uniform marked morphism to a word. - Anna E. Frid (Discret. Math. Theor. Comput. Sci., 1999)

Arithmetical Complexity of Infinite Words. - Sergey V. Avgustinovich; Dmitry Fon-Der-Flaass; Anna E. Frid (Words, Languages & Combinatorics, 2000)

On the subword complexity of iteratively generated infinite words. - Anna E. Frid (Discret. Appl. Math., 2001)

On factor graphs of DOL words. - Anna E. Frid (Discret. Appl. Math., 2001)

Overlap-free symmetric D0L words. - Anna E. Frid (Discret. Math. Theor. Comput. Sci., 2001)

Words Avoiding Abelian Inclusions. - Sergey V. Avgustinovich; Anna E. Frid (J. Autom. Lang. Comb., 2002)

Arithmetical complexity of symmetric D0L words. - Anna E. Frid (Theor. Comput. Sci., 2003)

A Unique Decomposition Theorem for Factorial Languages. - Sergey V. Avgustinovich; Anna E. Frid (Int. J. Algebra Comput., 2005)

Sequences of linear arithmetical complexity. - Anna E. Frid (Theor. Comput. Sci., 2005)

Canonical Decomposition of a Regular Factorial Language. - Sergey V. Avgustinovich; Anna E. Frid (CSR, 2006)

Canonical decomposition of catenation of factorial languages - Anna E. Frid (CoRR, 2006)

Sequences of low arithmetical complexity. - Sergey V. Avgustinovich; Julien Cassaigne; Anna E. Frid (RAIRO Theor. Informatics Appl., 2006)

On possible growths of arithmetical complexity. - Anna E. Frid (RAIRO Theor. Informatics Appl., 2006)

Commutation of Binary Factorial Languages. - Anna E. Frid (Developments in Language Theory, 2007)

On periodicity and low complexity of infinite permutations. - Dmitry Fon-Der-Flaass; Anna E. Frid (Eur. J. Comb., 2007)

On the arithmetical complexity of Sturmian words. - Julien Cassaigne; Anna E. Frid (Theor. Comput. Sci., 2007)

Simple equations on binary factorial languages. - Anna E. Frid (Theor. Comput. Sci., 2009)

Infinite permutations vs. infinite words - Anna E. Frid (WORDS, 2011)

On the number of factors in codings of three interval exchange. - Petr Ambroz; Anna E. Frid; Zuzana Masáková; Edita Pelantová (Discret. Math. Theor. Comput. Sci., 2011)

Infinite permutations of lowest maximal pattern complexity. - Sergey V. Avgustinovich; Anna E. Frid; Teturo Kamae; Pavel Salimov (Theor. Comput. Sci., 2011)

On minimal factorizations of words as products of palindromes - Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (CoRR, 2012)

On automatic infinite permutations. - Anna E. Frid; Luca Q. Zamboni (RAIRO Theor. Informatics Appl., 2012)

On palindromic factorization of words. - Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (Adv. Appl. Math., 2013)

Subword Complexity and Decomposition of the Set of Factors. - Julien Cassaigne; Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (MFCS (1), 2014)

The number of binary rotation words. - Anna E. Frid; Damien Jamet (RAIRO Theor. Informatics Appl., 2014)

Canonical Representatives of Morphic Permutations. - Sergey V. Avgustinovich; Anna E. Frid; Svetlana Puzynina (WORDS, 2015)

Ergodic Infinite Permutations of Minimal Complexity. - Sergey V. Avgustinovich; Anna E. Frid; Svetlana Puzynina (DLT, 2015)

Words containing all permutations of a family of factors. - Anna E. Frid (CoRR, 2015)

Cost and dimension of words of zero topological entropy. - Julien Cassaigne; Anna E. Frid; Svetlana Puzynina; Luca Q. Zamboni (CoRR, 2016)

Minimal complexity of equidistributed infinite permutations. - Sergey V. Avgustinovich; Anna E. Frid; Svetlana Puzynina (Eur. J. Comb., 2017)

Number of valid decompositions of Fibonacci prefixes. - Pierre Bonardo; Anna E. Frid (CoRR, 2018)

Equidistributed sequences and pure morphic subshifts. - Mélodie Andrieu; Anna E. Frid (CoRR, 2018)

Sturmian numeration systems and decompositions to palindromes. - Anna E. Frid (Eur. J. Comb., 2018)

First Lower Bounds for Palindromic Length. - Anna E. Frid (DLT, 2019)

Prefix Palindromic Length of the Thue-Morse Word. - Anna E. Frid (J. Integer Seq., 2019)

The number of valid factorizations of Fibonacci prefixes. - Pierre Bonardo; Anna E. Frid; Jeffrey O. Shallit (Theor. Comput. Sci., 2019)

Morphic words and equidistributed sequences. - Mélodie Andrieu; Anna E. Frid (Theor. Comput. Sci., 2020)

On prefix palindromic length of automatic words. - Anna E. Frid; Enzo Laborde; Jarkko Peltomäki (Theor. Comput. Sci., 2021)

Prefix Palindromic Length of the Sierpinski Word. - Dora V. Bulgakova; Anna E. Frid; Jérémy Scanvic (DLT, 2022)