TY - JOUR AU - Alexander Meduna AU - Martin Švec PY - 2002/01/01 Y2 - 2024/03/29 TI - Reduction of simple semi-conditional grammars with respect to the number of conditional productions JF - Acta Cybernetica JA - Acta Cybern VL - 15 IS - 3 SE - Regular articles DO - UR - https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3584 AB - The present paper discusses the descriptional complexity of simple semiconditional 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 morethan twelve conditional productions. ER -