| |
| 2007 | ||
|---|---|---|
| 16 | EE | Anna E. Frid: Commutation of Binary Factorial Languages. Developments in Language Theory 2007: 193-204 |
| 15 | EE | Dmitry Fon-Der-Flaass, Anna E. Frid: On periodicity and low complexity of infinite permutations. Eur. J. Comb. 28(8): 2106-2114 (2007) |
| 14 | EE | Julien Cassaigne, Anna E. Frid: On the arithmetical complexity of Sturmian words. Theor. Comput. Sci. 380(3): 304-316 (2007) |
| 2006 | ||
| 13 | EE | Sergey V. Avgustinovich, Anna E. Frid: Canonical Decomposition of a Regular Factorial Language. CSR 2006: 18-22 |
| 12 | EE | Anna E. Frid: Canonical decomposition of catenation of factorial languages CoRR abs/cs/0610149: (2006) |
| 2005 | ||
| 11 | EE | Sergey V. Avgustinovich, Anna E. Frid: A Unique Decomposition Theorem for Factorial Languages. IJAC 15(1): 149-160 (2005) |
| 10 | EE | Anna E. Frid: Sequences of linear arithmetical complexity. Theor. Comput. Sci. 339(1): 68-87 (2005) |
| 2003 | ||
| 9 | EE | Anna E. Frid: Arithmetical complexity of symmetric D0L words. Theor. Comput. Sci. 306(1-3): 535-542 (2003) |
| 2002 | ||
| 8 | Sergey V. Avgustinovich, Anna E. Frid: Words Avoiding Abelian Inclusions. Journal of Automata, Languages and Combinatorics 7(1): 3-9 (2002) | |
| 2001 | ||
| 7 | Anna E. Frid: On the subword complexity of iteratively generated infinite words. Discrete Applied Mathematics 114(1-3): 115-120 (2001) | |
| 6 | Anna E. Frid: On factor graphs of DOL words. Discrete Applied Mathematics 114(1-3): 121-130 (2001) | |
| 5 | EE | Anna E. Frid: Overlap-free symmetric D0L words. Discrete Mathematics & Theoretical Computer Science 4(2): 357-362 (2001) |
| 1999 | ||
| 4 | EE | Anna E. Frid: Applying a uniform marked morphism to a word. Discrete Mathematics & Theoretical Computer Science 3(3): 125-140 (1999) |
| 1998 | ||
| 3 | Anna E. Frid: On Uniform DOL Words. STACS 1998: 544-554 | |
| 2 | Anna E. Frid: On the Frequency of Factors in a D0L Word. Journal of Automata, Languages and Combinatorics 3(1): 29-42 (1998) | |
| 1997 | ||
| 1 | Anna E. Frid: The Subword Complexity of Fixed Points of Binary Uniform Morphisms. FCT 1997: 179-187 | |
| 1 | Sergey V. Avgustinovich | [8] [11] [13] |
| 2 | Julien Cassaigne | [14] |
| 3 | Dmitry Fon-Der-Flaass | [15] |