Hierarchy of k-context-free languages

Abstract

This is the second part of a paper investigating k-context-free languages. Here, using results obtained in Part 1 (Intern. J. Computer Math. 26, pp. 69-90) we show that for every k the family of k-languages is properly included in the family of (k + 1)-languages. Also, it it is seen that for k≧3 the family of k-languages is incomparable with EOL languages.

Keywords:

• Pattern selector grammars
• schedules

C.R. Categories:

• F.4.2
• F.4.3