Local Languages and the Berry-Sethi Algorithm

@article{Berstel1996LocalLA,
  title={Local Languages and the Berry-Sethi Algorithm},
  author={Jean Berstel and Jean-{\'E}ric Pin},
  journal={Theor. Comput. Sci.},
  year={1996},
  volume={155},
  pages={439-446}
}
One of the basic tasks in compiler construction, document processing, hypertext software and similar projects is the efficient construction of a finite automaton from a given rational (regular) expression. The aim of the present paper is togive an exposition and a formal proof of the background for the algorithm of Berry and Sethi relating the computation involved to a well-known family of recognizable languages, the local languages. 
Highly Cited
This paper has 78 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

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

Notes de révision : Automates et langages

Benjamin M ONMEGE, Sylvain S CHMITZ
2009
View 6 Excerpts
Method Support
Highly Influenced

Implementation and Application of Automata

Lecture Notes in Computer Science • 2012
View 8 Excerpts
Method Support
Highly Influenced

Families of locally testable languages

Theor. Comput. Sci. • 2000
View 11 Excerpts
Highly Influenced

One-Unambiguous Regular Languages

Inf. Comput. • 1998
View 3 Excerpts
Highly Influenced

Fuzzy Local Languages

View 3 Excerpts
Highly Influenced

Traces of Control-Flow Graphs

Developments in Language Theory • 2009
View 3 Excerpts
Highly Influenced

78 Citations

0510'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 78 citations based on the available data.

See our FAQ for additional information.

References

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

A taxonomy of finite automata constru~on algorithms, Computing Science Note 93-43

Ill B.W. Watson
Eindhoven University of Technology. The Netherlands, • 1993

A taxonomy of finite automata minimization algorithms, Computing Science Note 93-44

B. W. Watson
Eindhoven University of Technology, The Netherlands, • 1993

B~~emann-Klein, Regular expressions into finite automata, in: LATIN’92

A. 4-j
Lecture Notes in Computer Science, Vol • 1992

Compilers: Principles, Techniques, and Tools

Addison-Wesley series in computer science / World student series edition • 1986

Automata, languages, and machines., B

Pure and applied mathematics • 1974

The abstract theory of automata

V. M. Glushkov
Russian Math. Surveys • 1961