•
•
•
•
What is DaniWeb IT Discussion Community?
You're currently browsing the Software Developers' Lounge section within the Software Development category of DaniWeb, a massive community of 401,509 software developers, web developers, Internet marketers, and tech gurus who are all enthusiastic about making contacts, networking, and learning from each other. In fact, there are 3,284 IT professionals currently interacting right now! Registration is free, only takes a minute and lets you enjoy all of the interactive features of the site.
Views: 730 | Replies: 2
 |
•
•
Join Date: Jan 2008
Posts: 2
Reputation: 
Rep Power: 0
Solved Threads: 0
Newbie Poster
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
this is the regular expression
(101+111+100)*(0+1)*(0+1)(00+101+11)(10+01)*
pls help me solved this problem
Last edited by Narue : Jan 18th, 2008 at 1:04 pm. Reason: Snipped email
•
•
Join Date: Oct 2007
Location: Cambridge, MA
Posts: 246
Reputation:
Rep Power: 1
Solved Threads: 20
Posting Whiz in Training
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.
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.
•
•
Join Date: Jan 2008
Posts: 2
Reputation:
Rep Power: 0
Solved Threads: 0
Newbie Poster
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...
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...
|
•
•
•
•
•
•
•
•
DaniWeb Software Developers' Lounge Marketplace
•
•
•
•
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
Linear Mode
•
•
•
•
applications asp blog browsing bt business business software developer development devices erp systems experiment firefox india intel internet it japan java linux malware mcafee media microsoft mmorpg mobile applications msdn news office open-source pricing programming project management rss search security software software selection spyware sql sun super technology evaluation tips vista web wiki windows xp
- need code for NFA to DFA (Computer Science and Software Design)
- i need deterministic finite automata C program (C)
- Turing completeness (Computer Science and Software Design)
- how to convert NFA to DFA in c (C++)
- finite automata (Computer Science and Software Design)
- Translate an algorithm to C program (C)
Other Threads in the Software Developers' Lounge Forum
- Previous Thread: Command LIne?
- Next Thread: need help in my project design
