I dunno much about Unicode, but I imagine it is a regular language? (Aka: acception / rejection can be determined by regular expressions / finite state machines)
If so, regular languages are one of those 'surprising things that can be parallelized'. It doesn't seem possible at first thought though.
If so, regular languages are one of those 'surprising things that can be parallelized'. It doesn't seem possible at first thought though.