In computer science, Thompson's construction is an algorithm for transforming a regular expression into an equivalent nondeterministic finiteâ€¦Â (More)

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)

Is this relevant?

2014

2014

- Ryutaro Kurai, Norihito Yasuda, Hiroki Arimura, Shinobu Nagayama, Shin-ichi Minato
- Stringology
- 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

- Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
- SPIRE
- 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)

Is this relevant?

2004

2004

- Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi
- Discrete Applied Mathematics
- 2004

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?

2004

2004

- Guangming Xing
- Int. J. Comput. Math.
- 2004

The problem of converting a regular expression to NFA is a fundamental problem that has been well studied. However, the two basicâ€¦Â (More)

Is this relevant?

1999

1999

- Dora Giammarresi, Jean-Luc Ponty, Derick Wood
- WIA
- 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?