A strongly primitive word of arbitrary length and its application †
- 1 January 1977
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 6 (3) , 165-170
- https://doi.org/10.1080/00207167708803136
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.Keywords
This publication has 2 references indexed in Scilit:
- Classification of noncounting eventsJournal of Computer and System Sciences, 1971
- On finite automata with a time-variant structureInformation and Control, 1968