 | 2011 |
|---|
| 25 |       | Anna E. Frid:
Infinite permutations vs. infinite words
WORDS 2011: 13-19 |
| 24 | | Anna E. Frid,
Luca Q. Zamboni:
On automatic infinite permutations
CoRR abs/1109.6131: (2011) |
| 23 | | Petr Ambroz,
Anna E. Frid,
Zuzana Masáková,
Edita Pelantová:
On the number of factors in codings of three interval exchange.
Discrete Mathematics & Theoretical Computer Science 13(3): 51-66 (2011) |
| 22 | | Sergey V. Avgustinovich,
Anna E. Frid,
T. Kamae,
P. Salimov:
Infinite permutations of lowest maximal pattern complexity.
Theor. Comput. Sci. 412(27): 2911-2921 (2011) |
| 2009 |
|---|
| 21 | | Anna E. Frid,
Andrey Morozov,
Andrey Rybalchenko,
Klaus W. Wagner:
Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings
Springer 2009 |
| 20 | | Anna E. Frid:
Simple equations on binary factorial languages.
Theor. Comput. Sci. 410(30-32): 2947-2956 (2009) |
| 2007 |
|---|
| 19 | | Anna E. Frid:
Commutation of Binary Factorial Languages.
Developments in Language Theory 2007: 193-204 |
| 18 | | Dmitry Fon-Der-Flaass,
Anna E. Frid:
On periodicity and low complexity of infinite permutations.
Eur. J. Comb. 28(8): 2106-2114 (2007) |
| 17 | | Julien Cassaigne,
Anna E. Frid:
On the arithmetical complexity of Sturmian words.
Theor. Comput. Sci. 380(3): 304-316 (2007) |
| 2006 |
|---|
| 16 | | Sergey V. Avgustinovich,
Anna E. Frid:
Canonical Decomposition of a Regular Factorial Language.
CSR 2006: 18-22 |
| 15 | | Anna E. Frid:
Canonical decomposition of catenation of factorial languages
CoRR abs/cs/0610149: (2006) |
| 14 | | Anna E. Frid:
On possible growths of arithmetical complexity.
ITA 40(3): 443-458 (2006) |
| 13 | | Sergey V. Avgustinovich,
Julien Cassaigne,
Anna E. Frid:
Sequences of low arithmetical complexity.
ITA 40(4): 569-582 (2006) |
| 2005 |
|---|
| 12 | | Sergey V. Avgustinovich,
Anna E. Frid:
A Unique Decomposition Theorem for Factorial Languages.
IJAC 15(1): 149-160 (2005) |
| 11 | | Anna E. Frid:
Sequences of linear arithmetical complexity.
Theor. Comput. Sci. 339(1): 68-87 (2005) |
| 2003 |
|---|
| 10 | | Anna E. Frid:
Arithmetical complexity of symmetric D0L words.
Theor. Comput. Sci. 306(1-3): 535-542 (2003) |
| 2002 |
|---|
| 9 |  | Sergey V. Avgustinovich,
Anna E. Frid:
Words Avoiding Abelian Inclusions.
Journal of Automata, Languages and Combinatorics 7(1): 3-9 (2002) |
| 2001 |
|---|
| 8 | | Anna E. Frid:
On the subword complexity of iteratively generated infinite words.
Discrete Applied Mathematics 114(1-3): 115-120 (2001) |
| 7 | | Anna E. Frid:
On factor graphs of DOL words.
Discrete Applied Mathematics 114(1-3): 121-130 (2001) |
| 6 | | Anna E. Frid:
Overlap-free symmetric D0L words.
Discrete Mathematics & Theoretical Computer Science 4(2): 357-362 (2001) |
| 2000 |
|---|
| 5 | | Sergey V. Avgustinovich,
Dmitry Fon-Der-Flaass,
Anna E. Frid:
Arithmetical Complexity of Infinite Words.
Words, Languages & Combinatorics 2000: 51-62 |
| 1999 |
|---|
| 4 | | 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page