RESULTS CONCERNING THINNESS OF D0L LANGUAGES
Juha Honkala · International Journal of Algebra and Computation · 2000
A language L is called thin if there exists an integer n0such that for all n≥n0L contains at most one word of length n. We show that thinness is decidable for exponential D0L languages. We show also that Siegel's result concerning integral points on algebraic curves of positive genus can often be used to prove that a polynomially bounded HD0L language is thin.