diff options
| author | Sven Verdoolaege <skimo@kotnet.org> | 2010-04-15 11:12:53 +0200 |
|---|---|---|
| committer | Sven Verdoolaege <skimo@kotnet.org> | 2010-04-15 13:33:36 +0200 |
| commit | 77ab1fde2f5d1c388dde51b87d7f9b57f26b093c (patch) | |
| tree | ad1a621b5c14e137834f0eea32d5fac1d23317fd /doc | |
| parent | ab1a924422d634c691bd6ea70f2492951d89c757 (diff) | |
| download | isl-77ab1fde2f5d1c388dde51b87d7f9b57f26b093c.tar.gz isl-77ab1fde2f5d1c388dde51b87d7f9b57f26b093c.tar.bz2 isl-77ab1fde2f5d1c388dde51b87d7f9b57f26b093c.zip | |
doc: fix typos
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/implementation.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/implementation.tex b/doc/implementation.tex index bdacc572..95166ef9 100644 --- a/doc/implementation.tex +++ b/doc/implementation.tex @@ -482,7 +482,7 @@ T \subseteq R \cup \left(R \circ T\right) $$ This is essentially Theorem~5 of \shortciteN{Kelly1996closure}. The only difference is that they only consider lexicographically -forward relations, a special case of acyclic relation. +forward relations, a special case of acyclic relations. If, on the other hand, $R$ is cyclic, then we have to resort to checking whether the approximation $K$ of the power is exact. @@ -812,7 +812,7 @@ k \, \vec L \le \vec j - \vec i \le k \, \vec U $$ However, when we intersect domain and range of this relation with those of the input relation, then the result only contains -the idenity mapping on the intersection of domain and range. +the identity mapping on the intersection of domain and range. \shortciteN{Kelly1996closure} propose to intersect domain and range with then {\em union} of domain and range of the input relation instead and call the result $R_i^?$. |