RESULTS CONCERNING THINNESS OF D0L LANGUAGES
2000 ◽
Vol 10
(02)
◽
pp. 209-216
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.
1995 ◽
Vol 90
(1-3)
◽
pp. 235-252
◽
2014 ◽
Vol 10
(06)
◽
pp. 1545-1551
◽
2003 ◽
Vol 2003
(565)
◽
2009 ◽
Vol 05
(04)
◽
pp. 585-590
◽
2020 ◽
Vol 2020
(1)
◽
pp. 9-16
Keyword(s):
Keyword(s):