Re: Finite state machines? UTF8: toFold(), normalisation, etc

From: John Cowan (
Date: Tue May 06 2003 - 10:46:25 EDT

  • Next message: Addison Phillips [wM]: "Re: Finite state machines? UTF8: toFold(), normalisation, etc"

    Theodore H. Smith scripsit:

    > I'm unfamiliar with "trie". What does it mean? If it's less complex
    > than a finite state machine I'm sure that'll be a benefit for me.

    It's a data structure for storing and retrieving (reTRIEving) strings
    efficiently. See .
    A good Unicode alternative is ternary search trees, which deal with
    the excessive fanout (number of alternatives at each level) that tries
    require: .

    > "Bits of Unicode" is in .ppt format. Is that "Power point"? I don't
    > have powerpoint or an app to read .ppt.

    On Windows you can grab the free Powerpoint viewer from Microsoft; on
    Windows and other platforms you can get from the site
    of that name.

    I marvel at the creature: so secret and         John Cowan
    so sly as he is, to come sporting in the pool
    before our very window.  Does he think that
    Men sleep without watch all night?  --Faramir

    This archive was generated by hypermail 2.1.5 : Tue May 06 2003 - 11:45:37 EDT