Abstract
It is known that both the class of all (n,k)-languages and the class of all time-variant languages over a finite alphabet contain the class of all regular languages. In this paper we show that in general neither one of these two classes of languages contains the other by constructing an infinite sequence of strongly primitive words over an alphabet with four letters.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
