Theory Language- What is the best way to convert a regular expression to an automata?

Asked Aug 13 '14 at 03:30

Active Jul 01 '22 at 14:22

Viewed 59 times

I have a question about how to convert a regular expression to aan automata? I hear about the Gluskov algorithm but i couldn't find a right document about it.

Example: i have an regular expression like (a*|b*) U (a*a|c*)* and i want to convert in a automata with a simple algorithm.

Please help me

edited Aug 13 '14 at 03:31

Raptor

53,206
45
230
366

asked Aug 13 '14 at 03:30

Itachi Uchiha

What did you try so far? – Hawk Aug 13 '14 at 03:37
This sounds like homework. Even if it isn't, we don't do the work for you, and we don't answer opinion based "what's the best way" questions. – Teepeemm Aug 13 '14 at 03:40
No i just ask about the Gluskov algorithm and the way how to use it – Itachi Uchiha Aug 20 '14 at 15:52
This question appears to be off-topic because it is most likely a homework question for which the OP has shown no effort. – jub0bs Dec 30 '14 at 21:01

Theory Language- What is the best way to convert a regular expression to an automata?

0 Answers0