Computer Science – Formal Languages and Automata Theory
Scientist
Computer Science
Formal Languages and Automata Theory
Scientist
Ural Federal University
Almost overlap-free words and the word problem for the free Burnside semigroup satisfying x^2=x^3
Combinatorial Characterization of Formal Languages
Constructing Premaximal Binary Cube-free Words of Any Level
Numerical values of the growth rates of power-free languages
On Pansiot Words Avoiding 3-Repetitions
No associations
LandOfFree
Arseny M. Shur does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Arseny M. Shur, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arseny M. Shur will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-197542