954,074 Members — Technology Publication meets Social Media
Username:
Password:
Lost login information?
Have something to say? Contribute New Article Reply to this Article

Finite Automata

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:(

kelvinco
Newbie Poster
2 posts since Jan 2008
Reputation Points: 10
Solved Threads: 0
 

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.

sarehu
Posting Whiz in Training
289 posts since Oct 2007
Reputation Points: 98
Solved Threads: 22
 

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

kelvinco
Newbie Poster
2 posts since Jan 2008
Reputation Points: 10
Solved Threads: 0
 

This article has been dead for over three months

Post: Markdown Syntax: Formatting Help
You
View similar articles that have also been tagged: