Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-09-22
Computer Science
Formal Languages and Automata Theory
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
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.
Profile ID: LFWR-SCP-O-638379