From regular expressions to finite automata

There are three classical algorithms to compute a finite automaton from a regular expression. The Brzozowski algorithm yields a deterministic automaton, the Glushkov algorithm a nondeterministic one, and the general step by step method generally yields a NFA with ϵ-transitions. Berry and Sethi have...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of computer mathematics Jg. 72; H. 4; S. 415 - 431
Hauptverfasser: Champarnaud, J.-M., Ponty, J.-L., Ziadi, D.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Gordon and Breach Science Publishers 01.01.1999
Taylor and Francis
Schlagworte:
Applied sciences
Automata. Abstract machines. Turing machines
B.7.1
Computer science; control theory; systems
Exact sciences and technology
F.4.3
F1.1
Finite automata
I.2.3
I.2.7
Language theory and syntactical analysis
position sets
regular expressions
Theoretical computing
Non deterministic automaton
Formal language
Position set
Glushkov automaton
Regular expression
Berry Sethi algorithm
Deterministic automaton
Finite automaton
Regular language
Algorithm
Kleene closure
ISSN:0020-7160, 1029-0265
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:There are three classical algorithms to compute a finite automaton from a regular expression. The Brzozowski algorithm yields a deterministic automaton, the Glushkov algorithm a nondeterministic one, and the general step by step method generally yields a NFA with ϵ-transitions. Berry and Sethi have adapted Brzozowski's algorithm to compute the Glushkov automaton of an expression. We describe a variant of the step by step construction which associates standard and trim automata to regular languages. We show that the automaton constructed by the variant and the Glushkov automaton (computed by Berry-Sethi algorithm) are isomorphic.
ISSN:0020-7160
1029-0265
DOI:10.1080/00207169908804865