Anna E. Frid

54 papers A 1B 1C 5Misc 2Journal 40Unranked 4
YearRankTypeTitle / Venue / Authors
2023 — ed.
Combinatorics on Words - 14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023, Proceedings
WORDS
Anna E. Frid, Robert Mercas
2022 C conf
Prefix Palindromic Length of the Sierpinski Word.
DLT
Dora V. Bulgakova, Anna E. Frid, Jérémy Scanvic
2022 J jnl
Prefix palindromic length of the Sierpinski word.
CoRR
Dora V. Bulgakova, Anna E. Frid, Jérémy Scanvic
2021 J jnl
On prefix palindromic length of automatic words.
Theor. Comput. Sci.
Anna E. Frid, Enzo Laborde, Jarkko Peltomäki
2020 J jnl
Morphic words and equidistributed sequences.
Theor. Comput. Sci.
Mélodie Andrieu, Anna E. Frid
2020 J jnl
On prefix palindromic length of automatic words.
CoRR
Anna E. Frid, Enzo Laborde, Jarkko Peltomäki
2019 C conf
First Lower Bounds for Palindromic Length.
DLT
Anna E. Frid
2019 J jnl
Prefix Palindromic Length of the Thue-Morse Word.
J. Integer Seq.
Anna E. Frid
2019 J jnl
Prefix palindromic length of the Thue-Morse word.
CoRR
Anna E. Frid
2019 J jnl
The number of valid factorizations of Fibonacci prefixes.
Theor. Comput. Sci.
Pierre Bonardo, Anna E. Frid, Jeffrey O. Shallit
2018 J jnl
Equidistributed sequences and pure morphic subshifts.
CoRR
Mélodie Andrieu, Anna E. Frid
2018 J jnl
Number of valid decompositions of Fibonacci prefixes.
CoRR
Pierre Bonardo, Anna E. Frid
2018 J jnl
Sturmian numeration systems and decompositions to palindromes.
Eur. J. Comb.
Anna E. Frid
2017 J jnl
Minimal complexity of equidistributed infinite permutations.
Eur. J. Comb.
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
2017 J jnl
Sturmian numeration systems and decompositions to palindromes.
CoRR
Anna E. Frid
2016 J jnl
Cost and dimension of words of zero topological entropy.
CoRR
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
2015 — conf
Canonical Representatives of Morphic Permutations.
WORDS
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
2015 J jnl
Canonical Representatives of Morphic Permutations.
CoRR
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
2015 C conf
Ergodic Infinite Permutations of Minimal Complexity.
DLT
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
2015 J jnl
Ergodic infinite permutations of minimal complexity.
CoRR
Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina
2015 J jnl
Words containing all permutations of a family of factors.
CoRR
Anna E. Frid
2014 — conf
Subword Complexity and Decomposition of the Set of Factors.
MFCS (1)
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
2014 J jnl
Subword complexity and decomposition of the set of factors.
CoRR
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
2014 J jnl
The number of binary rotation words.
RAIRO Theor. Informatics Appl.
Anna E. Frid, Damien Jamet
2013 J jnl
On palindromic factorization of words.
Adv. Appl. Math.
Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
2013 J jnl
The number of binary rotation words
CoRR
Anna E. Frid, Damien Jamet
2012 J jnl
On automatic infinite permutations.
RAIRO Theor. Informatics Appl.
Anna E. Frid, Luca Q. Zamboni
2012 J jnl
On minimal factorizations of words as products of palindromes
CoRR
Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni
2011 J jnl
Infinite permutations of lowest maximal pattern complexity.
Theor. Comput. Sci.
Sergey V. Avgustinovich, Anna E. Frid, Teturo Kamae, Pavel Salimov
2011 — conf
Infinite permutations vs. infinite words
WORDS
Anna E. Frid
2011 J jnl
On automatic infinite permutations
CoRR
Anna E. Frid, Luca Q. Zamboni
2011 J jnl
On the number of factors in codings of three interval exchange.
Discret. Math. Theor. Comput. Sci.
Petr Ambroz, Anna E. Frid, Zuzana Masáková, Edita Pelantová
2009 Misc ed.
Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings
CSR
Anna E. Frid, Andrey Morozov, Andrey Rybalchenko, Klaus W. Wagner
2009 J jnl
Simple equations on binary factorial languages.
Theor. Comput. Sci.
Anna E. Frid
2007 C conf
Commutation of Binary Factorial Languages.
Developments in Language Theory
Anna E. Frid
2007 J jnl
On periodicity and low complexity of infinite permutations.
Eur. J. Comb.
Dmitry Fon-Der-Flaass, Anna E. Frid
2007 J jnl
On the arithmetical complexity of Sturmian words.
Theor. Comput. Sci.
Julien Cassaigne, Anna E. Frid
2006 Misc conf
Canonical Decomposition of a Regular Factorial Language.
CSR
Sergey V. Avgustinovich, Anna E. Frid
2006 J jnl
Canonical decomposition of catenation of factorial languages
CoRR
Anna E. Frid
2006 J jnl
On possible growths of arithmetical complexity.
RAIRO Theor. Informatics Appl.
Anna E. Frid
2006 J jnl
Sequences of low arithmetical complexity.
RAIRO Theor. Informatics Appl.
Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid
2005 J jnl
A Unique Decomposition Theorem for Factorial Languages.
Int. J. Algebra Comput.
Sergey V. Avgustinovich, Anna E. Frid
2005 J jnl
Sequences of linear arithmetical complexity.
Theor. Comput. Sci.
Anna E. Frid
2003 J jnl
Arithmetical complexity of symmetric D0L words.
Theor. Comput. Sci.
Anna E. Frid
2002 J jnl
Words Avoiding Abelian Inclusions.
J. Autom. Lang. Comb.
Sergey V. Avgustinovich, Anna E. Frid
2001 J jnl
On factor graphs of DOL words.
Discret. Appl. Math.
Anna E. Frid
2001 J jnl
On the subword complexity of iteratively generated infinite words.
Discret. Appl. Math.
Anna E. Frid
2001 J jnl
Overlap-free symmetric D0L words.
Discret. Math. Theor. Comput. Sci.
Anna E. Frid
2000 — conf
Arithmetical Complexity of Infinite Words.
Words, Languages & Combinatorics
Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid
1999 J jnl
Applying a uniform marked morphism to a word.
Discret. Math. Theor. Comput. Sci.
Anna E. Frid
1998 C conf
On Bispecial Words and Subword Complexity of DOL Sequences.
SETA
Anna E. Frid, Sergey V. Avgustinovich
1998 A conf
On Uniform DOL Words.
STACS
Anna E. Frid
1998 J jnl
On the Frequency of Factors in a D0L Word.
J. Autom. Lang. Comb.
Anna E. Frid
1997 B conf
The Subword Complexity of Fixed Points of Binary Uniform Morphisms.
FCT
Anna E. Frid