Compatibility decomposition
From Free net encyclopedia
(Difference between revisions)
| Revision as of 18:59, 22 September 2004 JTN (Talk | contribs) Category:Unicode ← Previous diff |
Current revision JTN (Talk | contribs) Category:Unicode |
Current revision
In Unicode, the compatibility decomposition of a character is a string that holds the relation of compatibility equivalence to the original character. The procedure may be applied recursively, i.e. the characters in the decomposition string may be decomposed in their turn.
See also: Unicode, canonical decomposition