A Reexamination of the Glushkov and Thompson Constructions

  • Dora Giammarresiy, Jean-Luc Pontyz, Derick Woodx
  • Published 1998


We reexamine the relationship between the two most popular methods for transforming a regular expression into a nite-state machine: the Glushkov and Thompson constructions. These methods have received more attention recently because of the Standard Generalized Markup Language (SGML) and a revival of interest in symbolic toolkits for regular and context-free expressions, grammars, and machines. We establish that: Every Thompson machine is, in a sense we make precise, a Glushkov machine Every Glushkov machine is hidden in the corresponding Thompson machine

1 Figure or Table

Cite this paper

@inproceedings{Giammarresiy1998ARO, title={A Reexamination of the Glushkov and Thompson Constructions}, author={Dora Giammarresiy and Jean-Luc Pontyz and Derick Woodx}, year={1998} }