On the completeness and supercompleteness of algorithmic models for comparing text fragments

Verfasser / Beitragende:
[G. Nikitov]
Ort, Verlag, Jahr:
2009
Enthalten in:
Computational Mathematics and Mathematical Physics, 49/9(2009-09-01), 1648-1652
Format:
Artikel (online)
ID: 453613276