Reduction of simple semi-conditional grammars with respect to the number of conditional productions

Authors

  • Alexander Meduna
  • Martin Švec

Abstract

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 more than twelve conditional productions.

Downloads

Download data is not yet available.

Downloads

Published

2002-01-01

How to Cite

Meduna, A., & Švec, M. (2002). Reduction of simple semi-conditional grammars with respect to the number of conditional productions. Acta Cybernetica, 15(3), 353–360. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3584

Issue

Section

Regular articles