A correction to “An optimal algorithm to compute all the covers of a string”
✍ Scribed by Dennis Moore; W.F. Smyth
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 265 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We describe an algorithm which computes the invariants of all \(G_{a}\)-actions on affine varieties, in case the invariant ring is finitely generated. The algorithm is based on a study of the kernel of a locally nilpotent derivation and some algoritlums from the theory of Gröbner bases.
Reiter [3] has developed a general theory of diagnosis based on first principles. His algorithm computes all diagnoses which explain the differences between the predicted and observed behavior of a given system. Unfortunately, Reiter's description of the algorithm is incorrect in that some diagnoses