||~R_girl~||

Member
Mar 21, 2008
34,536
460
0
can someone tell me how to convert the regular expression (a+ab) in to a Non-Deterministic Finite Automata (NDFA)
Urgent pls!:dull:
 

||~R_girl~||

Member
Mar 21, 2008
34,536
460
0
is this correct?
anyone

564011_10150641774709755_784134754_9307477_69780328_n.jpg
 

24234124

Member
Mar 21, 2012
16
7
0
Hey use JFLAP ;)

http://www.softpedia.com/get/Others/Home-Education/JFLAP.shtml


http://sourceforge.net/projects/openalgoviz/files/JFLAP/JFLAP-7.0.jar/download


menu
One should eventually see a blank screen that looks like the screen below.
intro

Now one can enter whatever expression that one wishes. Note that there should be no blanks in the regular expression, as any blank will be processed as a symbol of Σ. One such expression is in the screen below. One can either type it in directly, or load the file regExprToNfa.jff.
addedexpression

Converting to a NFA
After typing in an expression, there is nothing else that can be done in this editor window besides converting it to an NFA, so let's proceed to that. Click on the “Convert → Convert to NFA” menu option. If one uses the example provided earlier, this screen should come up (after resizing the window a little).
intronfa
 
  • Like
Reactions: mldarshana

||~R_girl~||

Member
Mar 21, 2008
34,536
460
0
yeah glad to know but let me tell you something, this is not a best place for get reliable answers. use Yahoo Answers or Answer Bag for that I am sure you can have ur answer within few hours or days.

yeah i know. i post in all forums i know of when i need an urgent answer
 

||~R_girl~||

Member
Mar 21, 2008
34,536
460
0
They are not obviously forums. nevertheless gotta go.

i know they are not. i was talking about those forums they have just for study helps. to be more specific i found this forum just to help students with problems in Programming and stuff like these.
aite
bye