Anna E. Frid

Publication Activity (10 Years)

Years Active: 1997-2022
Publications (10 Years): 20

Top Topics

Computational Effort

Top Venues

Theor. Comput. Sci.

Publications

Dora V. Bulgakova, Anna E. Frid, Jérémy Scanvic
Prefix palindromic length of the Sierpinski word. CoRR (2022)
Dora V. Bulgakova, Anna E. Frid, Jérémy Scanvic
Prefix Palindromic Length of the Sierpinski Word. DLT (2022)
Anna E. Frid, Enzo Laborde, Jarkko Peltomäki
On prefix palindromic length of automatic words. Theor. Comput. Sci. 891 (2021)
Mélodie Andrieu, Anna E. Frid
Morphic words and equidistributed sequences. Theor. Comput. Sci. 804 (2020)
Anna E. Frid, Enzo Laborde, Jarkko Peltomäki
On prefix palindromic length of automatic words. CoRR (2020)
Anna E. Frid
Prefix Palindromic Length of the Thue-Morse Word. J. Integer Seq. 22 (7) (2019)
Anna E. Frid
Prefix palindromic length of the Thue-Morse word. CoRR (2019)
Pierre Bonardo, Anna E. Frid, Jeffrey O. Shallit
The number of valid factorizations of Fibonacci prefixes. Theor. Comput. Sci. 775 (2019)
Anna E. Frid
First Lower Bounds for Palindromic Length. DLT (2019)
Anna E. Frid
Sturmian numeration systems and decompositions to palindromes. Eur. J. Comb. 71 (2018)
Pierre Bonardo, Anna E. Frid
Number of valid decompositions of Fibonacci prefixes. CoRR (2018)
Mélodie Andrieu, Anna E. Frid
Equidistributed sequences and pure morphic subshifts. CoRR (2018)
Anna E. Frid
Sturmian numeration systems and decompositions to palindromes. CoRR (2017)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Minimal complexity of equidistributed infinite permutations. Eur. J. Comb. 65 (2017)
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
Cost and dimension of words of zero topological entropy. CoRR (2016)
Anna E. Frid
Words containing all permutations of a family of factors. CoRR (2015)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Canonical Representatives of Morphic Permutations. CoRR (2015)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Ergodic Infinite Permutations of Minimal Complexity. DLT (2015)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Canonical Representatives of Morphic Permutations. WORDS (2015)
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
Ergodic infinite permutations of minimal complexity. CoRR (2015)
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
Subword complexity and decomposition of the set of factors. CoRR (2014)
Anna E. Frid, Damien Jamet
The number of binary rotation words. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
Subword Complexity and Decomposition of the Set of Factors. MFCS (1) (2014)
Anna E. Frid, Damien Jamet
The number of binary rotation words CoRR (2013)
Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
On palindromic factorization of words. Adv. Appl. Math. 50 (5) (2013)
Anna E. Frid, Luca Q. Zamboni
On automatic infinite permutations. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
On minimal factorizations of words as products of palindromes CoRR (2012)
Sergey V. Avgustinovich, Anna E. Frid, Teturo Kamae, Pavel Salimov
Infinite permutations of lowest maximal pattern complexity. Theor. Comput. Sci. 412 (27) (2011)
Anna E. Frid
Infinite permutations vs. infinite words WORDS (2011)
Anna E. Frid, Luca Q. Zamboni
On automatic infinite permutations CoRR (2011)
Petr Ambroz, Anna E. Frid, Zuzana Masáková, Edita Pelantová
On the number of factors in codings of three interval exchange. Discret. Math. Theor. Comput. Sci. 13 (3) (2011)
Anna E. Frid
Simple equations on binary factorial languages. Theor. Comput. Sci. 410 (30-32) (2009)
Julien Cassaigne, Anna E. Frid
On the arithmetical complexity of Sturmian words. Theor. Comput. Sci. 380 (3) (2007)
Anna E. Frid
Commutation of Binary Factorial Languages. Developments in Language Theory (2007)
Dmitry Fon-Der-Flaass, Anna E. Frid
On periodicity and low complexity of infinite permutations. Eur. J. Comb. 28 (8) (2007)
Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid
Sequences of low arithmetical complexity. RAIRO Theor. Informatics Appl. 40 (4) (2006)
Anna E. Frid
On possible growths of arithmetical complexity. RAIRO Theor. Informatics Appl. 40 (3) (2006)
Anna E. Frid
Canonical decomposition of catenation of factorial languages CoRR (2006)
Sergey V. Avgustinovich, Anna E. Frid
Canonical Decomposition of a Regular Factorial Language. CSR (2006)
Sergey V. Avgustinovich, Anna E. Frid
A Unique Decomposition Theorem for Factorial Languages. Int. J. Algebra Comput. 15 (1) (2005)
Anna E. Frid
Sequences of linear arithmetical complexity. Theor. Comput. Sci. 339 (1) (2005)
Anna E. Frid
Arithmetical complexity of symmetric D0L words. Theor. Comput. Sci. 306 (1-3) (2003)
Sergey V. Avgustinovich, Anna E. Frid
Words Avoiding Abelian Inclusions. J. Autom. Lang. Comb. 7 (1) (2002)
Anna E. Frid
On factor graphs of DOL words. Discret. Appl. Math. 114 (1-3) (2001)
Anna E. Frid
On the subword complexity of iteratively generated infinite words. Discret. Appl. Math. 114 (1-3) (2001)
Anna E. Frid
Overlap-free symmetric D0L words. Discret. Math. Theor. Comput. Sci. 4 (2) (2001)
Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid
Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics (2000)
Anna E. Frid
Applying a uniform marked morphism to a word. Discret. Math. Theor. Comput. Sci. 3 (3) (1999)
Anna E. Frid, Sergey V. Avgustinovich
On Bispecial Words and Subword Complexity of DOL Sequences. SETA (1998)
Anna E. Frid
On Uniform DOL Words. STACS (1998)
Anna E. Frid
On the Frequency of Factors in a D0L Word. J. Autom. Lang. Comb. 3 (1) (1998)
Anna E. Frid
The Subword Complexity of Fixed Points of Binary Uniform Morphisms. FCT (1997)