Detail výsledku
Forbidding ET0L Systems
Švec Martin, Ing., Ph.D.
This paper discusses forbidding E0L and ETOL Systems.
E0L Systems
The present paper introduces and discusses forbidding ET0L grammars whose productions have some attached strings, called forbidding conditions. These grammars can make a derivation step only by using productions whose forbidding conditions do not appear in the rewritten sentential form. The paper demonstrates that some well-known relationships concerning the language families resulting from ordinary ET0L grammars do not hold in terms of the forbidding ET0L grammars. Most interestingly, while E0L grammars are less powerful than ET0L grammars, their forbidding versions with conditions of length one are equally powerful. On the other hand, while EP0L grammars are as powerful as E0L grammars, FEP0L grammars are less powerful than FE0L grammars.
@article{BUT41997,
author="Alexandr {Meduna} and Martin {Švec}",
title="Forbidding ET0L Systems",
journal="Theoretical Computer Science",
year="2003",
volume="2003",
number="306",
pages="449--469",
issn="0304-3975"
}