Show simple item record

dc.contributor.authorXing, Guangming
dc.date.accessioned2014-03-03T20:07:22Z
dc.date.available2014-03-03T20:07:22Z
dc.date.issued2001-12
dc.identifier.otherxing_guangming_200112_phd
dc.identifier.urihttp://purl.galileo.usg.edu/uga_etd/xing_guangming_200112_phd
dc.identifier.urihttp://hdl.handle.net/10724/20485
dc.description.abstractResearch in regular languages and their associated computational problems has been revitalized by the rapid development of the Internet and its applications. The construction of finite automata from regular expressions is of central importance to a variety of practical problems, including DFA construction in Unix systems, lexical scanning, Internet searching, content-based network service, and computational biology. First, a “smart” parsing algorithm is developed which constructs a parse tree with at most
dc.publisheruga
dc.rightspublic
dc.subjectAlgorithm
dc.subjectRegular Expression
dc.subjectParse Tree
dc.subjectFinite Automaton
dc.subjectPattern Matching
dc.subjectSpace Complexity
dc.titleGenerating NFA for efficient pattern matching
dc.typeDissertation
dc.description.degreePhD
dc.description.departmentComputer Science
dc.description.majorComputer Science
dc.description.advisorE. Rodney Canfield
dc.description.committeeE. Rodney Canfield
dc.description.committeeRobert Robinson
dc.description.committeeJohn Miller
dc.description.committeeThiab Taha
dc.description.committeeMitchell Rothstein


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record