deterministic finite state machines and regular expressions

    Date: 10/19/07 (Algorithms)    Keywords: google

    Hi. I'm looking for an algorithm that can be used to translate a finite state machine directly into a regular expression without an intermediate step of a non-deterministic state machine. It's not necessary to get a direct explanation -- if you know of a good site for explaining said technique, would you please post it? There's a certain inefficiency in separating the wheat from the chafe in google searches on the matter.

    Source: http://community.livejournal.com/algorithms/93732.html

« Peak detection || Creating a better Go... »


antivirus | apache | asp | blogging | browser | bugtracking | cms | crm | css | database | ebay | ecommerce | google | hosting | html | java | jsp | linux | microsoft | mysql | offshore | offshoring | oscommerce | php | postgresql | programming | rss | security | seo | shopping | software | spam | spyware | sql | technology | templates | tracker | virus | web | xml | yahoo | home