Numerical values of the growth rates of power-free languages

Computer Science – Formal Languages and Automata Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages, 4 tables

Scientific paper

We present upper and two-sided bounds of the exponential growth rate for a
wide range of power-free languages. All bounds are obtained with the use of
algorithms previously developed by the author.

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

Numerical values of the growth rates of power-free languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Numerical values of the growth rates of power-free languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Numerical values of the growth rates of power-free languages will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-638379

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