Reduction of simple semi-conditional grammars with respect to the number of conditional productions
Alexander Meduna, Martin Švec · Acta Cybernetica · 2002
The present paper discusses the descriptional complexity of simple semi-conditional grammars with respect to the number of conditional productions. More specifically, it demonstrates that for every phrase-structure grammar, there exists an equivalent simple semi-conditional grammar that has no more than twelve conditional productions.