Rapport de Recherche Litp /
Litp research reports
7 pages - Février/February 1995 - Document en anglais.
PostScript : Ko /Kb
Titre / Title: Local languages and the Berry-Sethi algorithm
Abstract : 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 to give 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.
Publications internes Litp 1995 / Litp research reports 1995