Institute of Informatics
Acta Cybernetica
Past Issues
Volume 15, Number 3, 2002
Reductions of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions
# Reductions of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions

**Alexander Meduna and Martin Svec**

### Abstract (in LaTeX format)

The present paper discusses the descriptional complexity of simple semi-con\-ditional 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.

### Full text

Available electronic editions: PDF.

### DOI

DOI is not available for this article.

### BibTeX entry
`
@article{Meduna:2002:ActaCybernetica,`

author = {Alexander Meduna and Martin \v{S}vec},

title = {Reductions of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions},

journal = {Acta Cybernetica},

year = {2002},

volume = {15},

pages = {353--360},

number = {3},

abstract = {The present paper discusses the descriptional complexity of simple semi-con\-ditional 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}

}