| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 15, Number 3, 2002>>> |
 Magyarul
|
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.
Kewords: descriptional complexity, simple semi-conditional grammars.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
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}
}