Added: 9 months ago
From: profbbrown
Views: 8,729
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (24)

Sign In or Sign Up now to post a comment!
  • @gadeyonmechant01 what software are you using to write this stuff out???

  • @thisisreefTV I'm drawing on a Wacom Cintiq 21UX display. Drawing software is AutoDesk Sketchbook Express. I'm wearing a USB headset while I do these. The screen is captured and uploaded to YouTube by Camtasia 2. All driven by a Mac mini.

  • Why first table 5 value e* is not 5,3 ?

    cuz accept state?

  • also help me in reducing the no of states in dfa in your next video

  • thank you so much sir.....u really helped me a lot

  • It's a simple 2-state machine. How did he manage to make it a 4-state machine, that's probably the question.... (his diagram is wrong: from 5 there should be arrows x and y to 4,5,3)

    Anyway, here's the 2-state machine:

    > From State1 (start): x and z go to State2 (finish)

    > From State2: x and y loop separately to State2

    Voila... (thumbs up however for the presentation)

  • Comment removed

  • its a nice vid.. bt i have a confusion.. while creating the final NFA, when we create the NFA for (x|y)*, instead of making ε from 5to3, shouldnt we make it from 4 to 3?? coz else it can go from 1 to 5 accepting 'z' n then bcoz of ε it will go to 3 n then would accept x/y.. thus it can accept zx or zy or any combination of x&y after z which is undesirable?

  • my question is probably stupid,am kinda new to this but how come the Z cant be combien with anything else ? is it because we have x(x/y)* as a whole =A and Z=B wich leads to A/B ?

  • @gadeyonmechant01 That's correct. Z is a whole regular expression by itself.

  • @profbbrown thk you! i just saw the reply very informative videos btw

  • I'm going to be doing a new set of videos this semester. I'll be addressing some of your comments and hopefully fixing the errors! :)

  • @profbbrown please do closure properties, Kleene's theorem, regular language, .....basically do everything PLEASE !haha

  • How looks the second table, if the start-state have only e-transitions?

  • @dkfasdfasdf At the second table you doesn't begin with start-state, you have to use e-closure of the start-state. :-)

  • 0:39

    are you sure from this point??

    xyx??? or xyy

  • Great set of videos, very useful :)

  • when checking in first table the state 5 with epsilon, doesn't it go to itself and state 3? (at 4:53) thanks

  • @vipwoody You're right! I messed up on the conversion to the NFA. I will need to fix it with a new version of the video. Sorry!

  • @profbbrown no prob :) thanks for your videos anyway, very helpful

  • @profbbrown I think he meant conversion to DFA??

  • @profbrown aint we have to mention like this in first table (5) | - - - 5,3

    {just a question am I right or wrong plz correct me} :-/

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more