Extension of tabled 0L-systems and languages

On some context free languages that are not deterministic ETOL languages

“…Hence we can talk about ( ƒ, Z>)-big (in x t ), ( ƒ, £>)-small (in x t % unique (in x t ) 9 multiple (in x r ), D-recursive (in x t ) and Z>-nonrecursive (in x t ) letters.…”

“…It is also required, see condition (1), that in a neat subderivation the sets of letters occuring on each level are the same. 2) If y is in { 0, ..., k} and A is a letter from Min (xj) 9 then A is big (small, unique, multiple, recursive, nonrecursive) in Xj if and only if A is big (small, unique, multiple, recursive or nonrecursive respectively) in x t for every t in {0, ...,&}.…”

“…4) For every j in {0, ..., k} and every A in Min (xj) 9 if A is big then A is unique. none of them except for Z is recursive).…”

A pumping theorem for deterministic ETOL languages

“…In this section we recall the définitions of detenninistic ETOL Systems and languages (see Rozenberg [7]) and provide some examples of them. Définition 1.…”

“…This paper concentrâtes on the so called deterministic ETOL languages, one of the central families of languages in the L Systems theory (see, e.g., Downey [1], Ehrenfeucht and Rozenberg [4], Rozenberg [7] and Salomaa [9]). …”