Abstract
A language L over a finite alphabet is said to be semi-discrete if there exists a positive integer k such that L contains at most k words of any given length. If k=1, the language is said to be discrete. It is shown that a language is semi-discrete and context-free iff it is a discrete union of languages of the form , iff it is a finite disjoint union of discrete context-free languages. Closure properties and decision problems are studied for the class of semi-discrete context-free languages
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
