Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words

Michel Rigo, Pavel Salimov. Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words. In Juhani Karhumäki, Arto Lepistö, Luca Q. Zamboni, editors, Combinatorics on Words - 9th International Conference, WORDS 2013, Turku, Finland, September 16-20. Proceedings. Volume 8079 of Lecture Notes in Computer Science, pages 217-228, Springer, 2013. [doi]

@inproceedings{RigoS13,
  title = {Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words},
  author = {Michel Rigo and Pavel Salimov},
  year = {2013},
  doi = {10.1007/978-3-642-40579-2_23},
  url = {http://dx.doi.org/10.1007/978-3-642-40579-2_23},
  researchr = {https://researchr.org/publication/RigoS13},
  cites = {0},
  citedby = {0},
  pages = {217-228},
  booktitle = {Combinatorics on Words - 9th International Conference, WORDS 2013, Turku, Finland, September 16-20. Proceedings},
  editor = {Juhani Karhumäki and Arto Lepistö and Luca Q. Zamboni},
  volume = {8079},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-40578-5},
}