ON SPARSE 0L LANGUAGES OVER THE BINARY ALPHABET
Juha Honkala · WORLD SCIENTIFIC eBooks · 2001
Latteux and Thierrin have characterized sparse context-free languages by showing that a context-free language L is sparse if and only if L is bounded. We prove a similar result for binary 0L languages which are not D0L languages. Keywords: DT0L systems, innite words, decidability TUCS Research Group