@inproceedings{4fd4f81bf34a4d83852947aece79e0f3,
title = "Parameter-reduction of higher level grammars",
abstract = "A higher level (OI-)grammar is called terminating, if for every accessible term t there is at least one terminal term which can be derived from t. A grammar is called parameter-reduced, if it is terminating and has no superfluous parameters. For every grammar G of level n>0 which generates at least one term we construct grammars R(G) and P(G) such that R(G) and P(G) generate the same language as G but are terminating and paramter-reduced, respectively. We introduce a hierarchy of restrictions to the deletion capability of the grammars which allow a gradual decrease in the complexity of the algorithms from n-iterated exponential time to polynomial time.",
author = "Helmut Seidl",
note = "Publisher Copyright: {\textcopyright} 1988, Springer-Verlag.; 13th Colloquium on Trees in Algebra and Programming, CAAP 1988 ; Conference date: 21-03-1988 Through 24-03-1988",
year = "1988",
doi = "10.1007/BFb0026096",
language = "English",
isbn = "9783540190219",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "52--71",
editor = "M. Dauchet and M. Nivat",
booktitle = "CAAP 1988 - 13th Colloquium on Trees in Algebra and Programming, Proceedings",
}