Skip to search formSkip to main contentSkip to account menu

Thompson's construction

Known as: Thompson NFA, Thompson's construction algorithm 
In computer science, Thompson's construction is an algorithm for transforming a regular expression into an equivalent nondeterministic finite… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Cryptosystems based on the hardness of lattice problems have recently acquired much importance due to their average-case to worst… 
2010
2010
The Deletion-Insertion Correcting Code construction proposed by Davey and MacKay consists of an inner code that recovers… 
2010
2010
Abstract The dynamics of many plant populations essentially depend upon seed and seedling stages, and a persistent seed bank may… 
Highly Cited
2004
Highly Cited
2004
Bridge management systems can be classified as one of two types: network level or project level. The former type is concerned… 
Highly Cited
2001
Highly Cited
2001
Nickel sorption in illite suspensions was studied as a function of pH (4.5–8.0), reaction time (3 h, 24 h, and 1 wk) and ionic… 
1999
1999
Nitrogen sources and application methods in notill cotton production have received little attention by researchers. The… 
1998
1998
Binary decision diagrams (BDDs) have been shown to be a powerful tool in formal verification. Efficient BDD construction… 
1991
1991
Assume that the class of partial automorphisms of the monster model of a complete theory has the amalgamation property. The… 
Highly Cited
1988
Highly Cited
1988
The ability of 'competing fungi' in preharvested maize to interfere with Aspergillus flavus infection and aflatoxin contamination…