From Regular Expressions to Deterministic Automata

@article{Berry1986FromRE,
  title={From Regular Expressions to Deterministic Automata},
  author={G{\'e}rard Berry and Ravi Sethi},
  journal={Theor. Comput. Sci.},
  year={1986},
  volume={48},
  pages={117-126}
}
The main theorem allows an elegant algorithm to be refined into an efficient one. The elegant algorithm for constructing a finite automaton from a regular expression is based on 'derivatives of' regular expressions; the efficient algorithm is based on 'marking of' regular expressions. Derivatives of regular expressions correspond to state transitions in finite automata. When a finite automaton makes a transition under input symbol a, a leading a is stripped from the remaining input… CONTINUE READING
Highly Influential
This paper has highly influenced 28 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 159 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Natural semantics on the computer

  • D. Clement, J. Despeyroux, T. Despeyroux, L. Hascoet, G. Kahn
  • Tech. Rept. No. 416, INRIA, Sophia-Antipolis
  • 1985
Highly Influential
3 Excerpts

A language for specifying protocols and other coordinating processes , 5 th Phoenix Conf

  • J. Katzenelson, R. P. Kurshan
  • on Computer Communications
  • 1986

P

  • G. Berry
  • Couronne and G. ~onthier, The ESTEREL v2.1 System…
  • 1986
1 Excerpt

S/R: A language for specifying protocols and other coordinating processes

  • J. Katzenelson, R. P. Kurshan
  • 5th Phoenix Conf. on Computer Communications
  • 1986
1 Excerpt

MilneL A complete inference system for a class of regular behaviours

  • D. Scott
  • J . Comput . System ScL
  • 1984

Similar Papers

Loading similar papers…