Anna E. Frid

Available identifiers

zbMath Open frid.anna-eMaRDI QIDQ1750220

List of research outcomes

Publication	Date of Publication	Type
The subword complexity of fixed points of binary uniform morphisms	2022-12-09	Paper
Prefix palindromic length of the Sierpinski word	2022-08-11	Paper
Prefix palindromic length of the Sierpinski word	2022-01-24	Paper
On prefix palindromic length of automatic words	2021-10-21	Paper
On prefix palindromic length of automatic words	2020-09-07	Paper
Cost and dimension of words of zero topological entropy	2020-07-22	Paper
Prefix palindromic length of the Thue-Morse word	2020-01-27	Paper
Morphic words and equidistributed sequences	2019-12-27	Paper
First lower bounds for palindromic length	2019-10-15	Paper
A characterization of words of linear complexity	2019-06-26	Paper
The number of valid factorizations of Fibonacci prefixes	2019-05-29	Paper
Quelques m\'ethodes pour les mots sturmiens	2019-01-07	Paper
Sturmian numeration systems and decompositions to palindromes	2018-05-18	Paper
Minimal complexity of equidistributed infinite permutations	2017-08-31	Paper
Infinite permutations vs. infinite words	2016-03-01	Paper
Fine and Wilf's theorem for permutations	2015-11-16	Paper
Minimal complexity of equidistributed infinite permutations	2015-11-10	Paper
Canonical Representatives of Morphic Permutations	2015-11-04	Paper
Words containing all permutations of a family of factors	2015-10-27	Paper
Subword Complexity and Decomposition of the Set of Factors	2014-10-14	Paper
On the number of factors in codings of three interval exchange	2014-03-25	Paper
On palindromic factorization of words	2014-01-27	Paper
On minimal factorizations of words as products of palindromes	2012-10-23	Paper
On automatic infinite permutations	2012-08-31	Paper
On possible growths of Toeplitz languages	2011-05-19	Paper
https://portal.mardi4nfdi.de/entity/Q3576702	2010-07-30	Paper
Simple equations on binary factorial languages	2009-08-07	Paper
Canonical decomposition of catenation of factorial languages	2008-01-18	Paper
Commutation of Binary Factorial Languages	2007-11-28	Paper
On periodicity and low complexity of infinite permutations	2007-11-21	Paper
On the arithmetical complexity of Sturmian words	2007-07-16	Paper
Canonical Decomposition of a Regular Factorial Language	2007-05-02	Paper
Sequences of low arithmetical complexity	2007-02-20	Paper
On possible growths of arithmetical complexity	2007-02-08	Paper
A lower bound for the arithmetical complexity of Sturmian words	2006-08-24	Paper
Sequences of linear arithmetical complexity	2005-06-30	Paper
A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES	2005-06-07	Paper
Arithmetical complexity of symmetric D0L words.	2004-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q4453439	2004-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q3150246	2002-09-30	Paper
https://portal.mardi4nfdi.de/entity/Q4330626	2002-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q2768453	2002-04-23	Paper
On the subword complexity of iteratively generated infinite words.	2002-01-30	Paper
On factor graphs of DOL words	2002-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q4936661	2000-01-31	Paper
https://portal.mardi4nfdi.de/entity/Q3836532	1999-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q4221611	1999-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4242388	1999-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4345303	1997-07-22	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Anna E. Frid