@article {IOPORT.00627598,
    author       = {Madlener, Klaus and Sattler-Klein, Andrea and Otto, Friedrich},
    title        = {On the problem of generating small convergent systems.},
    year         = {1993},
    journal      = {Journal of Symbolic Computation},
    volume       = {16},
    number       = {2},
    issn         = {0747-7171},
    pages        = {167-187},
    publisher    = {Elsevier Science (Academic Press), London},
    doi          = {10.1006/jsco.1993.1040},
    abstract     = {Summary: A sequence $(R\sb{n,m})\sb{n,m\in \bbfN}$ of normalized string-rewriting systems on a fixed finite alphabet $\Sigma$ is constructed such that, for all $n,m\in \bbfN$, 1. $R\sb{n,m}$ contains 44 rules, it is of size $O(n+ m)$, and it is compatible with a length-lexicographical ordering $>$ on $\Sigma\sp*$, but 2. given the system $R\sb{n,m}$ and the ordering $>$ as input, the Knuth- Bendix completion procedure will generate more than $A(n,m)$ intermediate rules before a finite convergent system $S\sb{n,m}$ of size $O(n+ m)$ is obtained. Here, $A$ denotes Ackermann's function.},
    identifier   = {00627598},
}