Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Anna E. Frid
2010 – today
- 2013
[i4]- 2012
- [j17]Anna E. Frid, Luca Q. Zamboni: On automatic infinite permutations. RAIRO - Theor. Inf. and Applic. 46(1): 77-85 (2012)
- [i3]Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni: On minimal factorizations of words as products of palindromes. CoRR abs/1210.6179 (2012)
- 2011
- [j16]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)
- [j15]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)
- [c6]
- [i2]
2000 – 2009
- 2009
- [j14]Anna E. Frid: Simple equations on binary factorial languages. Theor. Comput. Sci. 410(30-32): 2947-2956 (2009)
- [e1]Anna E. Frid, Andrey Morozov, Andrey Rybalchenko, Klaus W. Wagner (Eds.): Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings. Lecture Notes in Computer Science 5675, Springer 2009, ISBN 978-3-642-03350-6
- 2007
- [j13]Dmitry Fon-Der-Flaass, Anna E. Frid: On periodicity and low complexity of infinite permutations. Eur. J. Comb. 28(8): 2106-2114 (2007)
- [j12]Julien Cassaigne, Anna E. Frid: On the arithmetical complexity of Sturmian words. Theor. Comput. Sci. 380(3): 304-316 (2007)
- [c5]Anna E. Frid: Commutation of Binary Factorial Languages. Developments in Language Theory 2007: 193-204
- 2006
- [j11]
- [j10]Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid: Sequences of low arithmetical complexity. ITA 40(4): 569-582 (2006)
- [c4]Sergey V. Avgustinovich, Anna E. Frid: Canonical Decomposition of a Regular Factorial Language. CSR 2006: 18-22
- [i1]Anna E. Frid: Canonical decomposition of catenation of factorial languages. CoRR abs/cs/0610149 (2006)
- 2005
- [j9]Sergey V. Avgustinovich, Anna E. Frid: A Unique Decomposition Theorem for Factorial Languages. IJAC 15(1): 149-160 (2005)
- [j8]
- 2003
- [j7]Anna E. Frid: Arithmetical complexity of symmetric D0L words. Theor. Comput. Sci. 306(1-3): 535-542 (2003)
- 2002
- [j6]Sergey V. Avgustinovich, Anna E. Frid: Words Avoiding Abelian Inclusions. Journal of Automata, Languages and Combinatorics 7(1): 3-9 (2002)
- 2001
- [j5]Anna E. Frid: On the subword complexity of iteratively generated infinite words. Discrete Applied Mathematics 114(1-3): 115-120 (2001)
- [j4]
- [j3]Anna E. Frid: Overlap-free symmetric D0L words. Discrete Mathematics & Theoretical Computer Science 4(2): 357-362 (2001)
- 2000
- [c3]Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid: Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics 2000: 51-62
1990 – 1999
- 1999
- [j2]Anna E. Frid: Applying a uniform marked morphism to a word. Discrete Mathematics & Theoretical Computer Science 3(3): 125-140 (1999)
- 1998
- [j1]Anna E. Frid: On the Frequency of Factors in a D0L Word. Journal of Automata, Languages and Combinatorics 3(1): 29-42 (1998)
- [c2]
- 1997
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-05 22:16 CEST by the dblp team