how can i convert these to Finite automata

this is the regular expression
(101+111+100)*(0+1)*(0+1)(00+101+11)(10+01)*

pls help me solved this problem:(

Do you have a textbook on the subject? Look in that.

If you don't, then imagine interpreting the regular expression by hand. It's not hard to figure out how it maps to a finite automaton that way, if you understand how regular expressions work.

how can i convert these to Finite automata

this is the regular expression
(101+111+100)*(0+1)*(0+1)(00+101+11)(10+01)*

pls help me solved this problem


>>>> ofcourse i got a book..
the book ofcourse only tell the basic and this problem is realy making my head ache..
i really need someone to just give me the finite automaton of this..
i almost got this FA but expresion on th e last part (10+01)* really fuck of...

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.