Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions

  Alexander Meduna and Martin Švec

  Acta Cybernetica 15 (2002) 353-360.

Abstract:

  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.

  Keywords: descriptional complexity, simple semi-conditional grammars