Extensions of sokolowski's theorem to prove languages are not context free or not regular

Philip W. Grant · International Journal of Computer Mathematics · 1982

An extension of a theorem of Sokolowski's is given which is more generally applicable and illustrated by showing several languages are not context free. This is then modified to prove a similar kind of theorem for regular languages.

Read the paper · More papers on PaperTik