3 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.FL2011
Almost overlap-free words and the word problem for the free Burnside semigroup satisfying x^2=x^3
A. N. Plyushchenko, A. M. Shur
In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent word…
cs.FL2010★ 3 cited
Combinatorial Characterization of Formal Languages
Arseny M. Shur
This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in th…
cs.FL2010
On ternary square-free circular words
Arseny M. Shur
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alph…