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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2014
012319992014

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper presents a new regular expression matching method by using Dual Glushkov NFA. Dual Glushkov NFA is the variant of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2014
2014
This paper presents a new regular expression matching method by using Dual Glushkov NFA. Dual Glushkov NFA is the variant of… (More)
Is this relevant?
2014
2014
This paper gives a new presentation of Kozen’s proof of Kleene algebra completeness featured in his article A completeness… (More)
Is this relevant?
2010
2010
In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 7
  • table 1
Is this relevant?
2004
2004
A nite-state machine is called a Thompson machine if it can be constructed from a regular expression using Thompson's… (More)
  • figure 2
  • figure 7
Is this relevant?
2004
2004
The problem of converting a regular expression to NFA is a fundamental problem that has been well studied. However, the two basic… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1999
1999
A nite-state machine is called a Thompson machine if it can be constructed from a regular expression using Thompson's… (More)
Is this relevant?