A Note on Uniformly Limited ETOL Systems with Unique Interpretation

We briefly consider a variant of /?ulETOL systems (abbreviated as ku’lETOL) where we require that in each derivation step, k dz@rent productions from the selected table have to be applied (if possible). We show that this subtle change leads to a new characterization of programmed grammars (without appearance checking), a result which is still unknown for… (More)