4. Computer Science
  5. Formal Languages and Automata Theory

Roman Kolpakov

Computer Science – Formal Languages and Automata Theory

Scientist

Rate now
  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientist

Linear pattern matching on sparse suffix trees

Computer Science – Data Structures and Algorithms
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On maximal repetitions of arbitrary exponent

Computer Science – Discrete Mathematics
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On primary and secondary repetitions in words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Roman Kolpakov does not yet have a rating. At this time, there are no reviews or comments for this scientist.

If you have personal experience with Roman Kolpakov, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Roman Kolpakov will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-P-127437

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.

Canada

 Charities
 Companies
 MP Candidates
 Patents
 Employee Salary Disclosure

World

 Places of the World
 Scientific Papers

United States

 Banks
 Companies
 Counties
 Patents
 Employee Salary Disclosure