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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 72; číslo 4; s. 415 - 431
Hlavní autoři: Champarnaud, J.-M., Ponty, J.-L., Ziadi, D.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Gordon and Breach Science Publishers 01.01.1999
Taylor and Francis
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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