Characterizations of right dense languages
Let X be an alphabet containing more than one letter and let \(X^*\) be the free monoid generated by X. A language \(S\subseteq X^*\) is right dense if \(uX^*\cap S\neq \emptyset\) for all \(u\in X^*\). The purpose of this paper is to give characterizations of right dense languages.
scientific article; zbMATH DE number 3929310