According to our database
1,
Anna E. Frid
authored at least 43 papers
between 1997 and 2022.
Collaborative distances:
2022
Prefix Palindromic Length of the Sierpinski Word.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022
2021
On prefix palindromic length of automatic words.
Theor. Comput. Sci., 2021
2020
Morphic words and equidistributed sequences.
Theor. Comput. Sci., 2020
2019
The number of valid factorizations of Fibonacci prefixes.
Theor. Comput. Sci., 2019
Prefix Palindromic Length of the Thue-Morse Word.
J. Integer Seq., 2019
First Lower Bounds for Palindromic Length.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019
2018
Sturmian numeration systems and decompositions to palindromes.
Eur. J. Comb., 2018
Equidistributed sequences and pure morphic subshifts.
CoRR, 2018
Number of valid decompositions of Fibonacci prefixes.
CoRR, 2018
2017
Minimal complexity of equidistributed infinite permutations.
Eur. J. Comb., 2017
2016
Cost and dimension of words of zero topological entropy.
CoRR, 2016
2015
Words containing all permutations of a family of factors.
CoRR, 2015
Ergodic Infinite Permutations of Minimal Complexity.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015
Canonical Representatives of Morphic Permutations.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015
2014
The number of binary rotation words.
RAIRO Theor. Informatics Appl., 2014
Subword Complexity and Decomposition of the Set of Factors.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
2013
On palindromic factorization of words.
Adv. Appl. Math., 2013
2012
On automatic infinite permutations.
RAIRO Theor. Informatics Appl., 2012
On minimal factorizations of words as products of palindromes
CoRR, 2012
2011
Infinite permutations of lowest maximal pattern complexity.
Theor. Comput. Sci., 2011
On the number of factors in codings of three interval exchange.
Discret. Math. Theor. Comput. Sci., 2011
Infinite permutations vs. infinite words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011
2009
Simple equations on binary factorial languages.
Theor. Comput. Sci., 2009
2007
On the arithmetical complexity of Sturmian words.
Theor. Comput. Sci., 2007
On periodicity and low complexity of infinite permutations.
Eur. J. Comb., 2007
Commutation of Binary Factorial Languages.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007
2006
On possible growths of arithmetical complexity.
RAIRO Theor. Informatics Appl., 2006
Sequences of low arithmetical complexity.
RAIRO Theor. Informatics Appl., 2006
Canonical decomposition of catenation of factorial languages
CoRR, 2006
Canonical Decomposition of a Regular Factorial Language.
Proceedings of the Computer Science, 2006
2005
Sequences of linear arithmetical complexity.
Theor. Comput. Sci., 2005
A Unique Decomposition Theorem for Factorial Languages.
Int. J. Algebra Comput., 2005
2003
Arithmetical complexity of symmetric D0L words.
Theor. Comput. Sci., 2003
2002
Words Avoiding Abelian Inclusions.
J. Autom. Lang. Comb., 2002
2001
Overlap-free symmetric D0L words.
Discret. Math. Theor. Comput. Sci., 2001
On factor graphs of DOL words.
Discret. Appl. Math., 2001
On the subword complexity of iteratively generated infinite words.
Discret. Appl. Math., 2001
2000
Arithmetical Complexity of Infinite Words.
Proceedings of the International Colloquium on Words, 2000
1999
Applying a uniform marked morphism to a word.
Discret. Math. Theor. Comput. Sci., 1999
1998
On the Frequency of Factors in a D0L Word.
J. Autom. Lang. Comb., 1998
Proceedings of the STACS 98, 1998
On Bispecial Words and Subword Complexity of DOL Sequences.
Proceedings of the Sequences and their Applications, 1998
1997
The Subword Complexity of Fixed Points of Binary Uniform Morphisms.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997
