Pavel Salimov

According to our database, Pavel Salimov authored at least 8 papers between 2011 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2015

Another generalization of abelian equivalence: Binomial complexity of infinite words.

Michel Rigo, Pavel Salimov

Theor. Comput. Sci., 2015

Avoiding 2-binomial squares and cubes.

Michaël Rao, Michel Rigo, Pavel Salimov

Theor. Comput. Sci., 2015

2014

A note on abelian returns in rotation words.

Narad Rampersad, Michel Rigo, Pavel Salimov

Theor. Comput. Sci., 2014

On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving).

Daniel Goc, Narad Rampersad, Michel Rigo, Pavel Salimov

Int. J. Found. Comput. Sci., 2014

2013

Restricted non-separable planar maps and some pattern avoiding permutations.

Sergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson

Discret. Appl. Math., 2013

On the Number of Abelian Bordered Words.

Narad Rampersad, Michel Rigo, Pavel Salimov

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2011

Infinite permutations of lowest maximal pattern complexity.

Sergey V. Avgustinovich, Anna E. Frid, Teturo Kamae, Pavel Salimov

Theor. Comput. Sci., 2011

On the Representability of Line Graphs.

Sergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson

Proceedings of the Developments in Language Theory - 15th International Conference, 2011