Hakuluettelo:
Käännös:
Knuth-Bendix completion algorithm (suomeksi)
- Määritelmät:
- (lb, en, comptheory) A semidecision algorithm for transforming a set of equations (over terms) into a confluent term rewrite, rewriting system.
Viimeisimmät haut: Knuth-Bendix completion algorithm, metafiction, Buterbaughs, sidestepping, Septemberers, prefix coding