( en | de | ru )

 

Disambiguation of "Frid, Anna E."

Author of the publication

copydeleteadd this publication to your clipboard
Minimal complexity of equidistributed infinite permutations.

, , and . Eur. J. Comb., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Frid Lauffs

Frid Muth

Frid Ruland

Heike Anna Brücker

Dirk Annacker

 

Other publications of authors with the same name

Morphic words and equidistributed sequences., and . Theor. Comput. Sci., (2020)Minimal complexity of equidistributed infinite permutations., , and . Eur. J. Comb., (2017)The number of binary rotation words., and . RAIRO Theor. Informatics Appl., 48 (4): 453-465 (2014)Subword Complexity and Decomposition of the Set of Factors., , , and . MFCS (1), volume 8634 of Lecture Notes in Computer Science, page 147-158. Springer, (2014)On Bispecial Words and Subword Complexity of DOL Sequences., and . SETA, page 191-204. Springer, (1998)Sequences of linear arithmetical complexity.. Theor. Comput. Sci., 339 (1): 68-87 (2005)Equidistributed sequences and pure morphic subshifts., and . CoRR, (2018)First Lower Bounds for Palindromic Length.. DLT, volume 11647 of Lecture Notes in Computer Science, page 234-243. Springer, (2019)Applying a uniform marked morphism to a word.. Discret. Math. Theor. Comput. Sci., 3 (3): 125-140 (1999)Overlap-free symmetric D0L words.. Discret. Math. Theor. Comput. Sci., 4 (2): 357-362 (2001)