Frid Anna Èduardovna

Publications in Math-Net.Ru

1. Fine and Wilf’s theorem for permutations
   
   Sib. Èlektron. Mat. Izv., 9 (2012),  377–381
2. On possible growths of Toeplitz languages
   
   Sibirsk. Mat. Zh., 52:1 (2011),  81–94
3. Canonical decomposition of catenation of factorial languages
   
   Sib. Èlektron. Mat. Izv., 4 (2007),  12–19
4. A lower bound for the arithmetical complexity of Sturmian words
   
   Sib. Èlektron. Mat. Izv., 2 (2005),  14–22
5. Distributive colorings of plane triangulations of minimum degree five
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001),  3–16
6. On graphs of subwords of DOL-sequences
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999),  92–103
7. The frequency of the occurrence of words in a DOL sequence
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 5:1 (1998),  82–87
8. On the combinatorial complexity of iteratively generated symbol sequences
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997),  53–59