Context-free languages consisting of non-primitive words

Masami Itō, Masashi Katsura · International Journal of Computer Mathematics · 1991

Let Q set of all primitive words over an alphabet In this paper, the structures of context-free languages contained in are determined. Observing these structures, we solve various problems related to context-free languages consisting of non-primitive words.

Read the paper · More papers on PaperTik