 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
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
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
