Results 1 to 2 of 2

Thread: NFA with epsilon moves

  1. #1
    Junior Member
    Sep 2013

    NFA with epsilon moves

    I am pretty confortable with designing DFA but now i am trying to learn how to design NFA with epsi moves but nit quite sure how to do it. I know that from one state i could have multiple path but how do you decide which state or how do you decide when to make epsilon (empty) move. ?

    can someone suggest couple tips for NFA please
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Oct 2009

    Re: NFA with epsilon moves

    As I remember, one role of epsilon-transitions in the theorem about the equivalence of regular expressions and finite automata is to implement alternation |. Suppose you have two properties P(s) and Q(s) and two automata AP and AQ that compute those properties. If you need to compute the disjunction of P(s) and Q(s), you can make an epsilon-transition to both automata.

    If you have concrete examples that need analyzing, feel free to post.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: Feb 26th 2013, 03:42 AM
  2. [SOLVED] want formula for number of moves to invert 'triangle'.
    Posted in the Discrete Math Forum
    Replies: 19
    Last Post: Dec 13th 2010, 01:28 PM
  3. Replies: 1
    Last Post: Nov 8th 2010, 09:45 AM
  4. Replies: 3
    Last Post: Oct 7th 2009, 10:24 AM
  5. Aparticle moves.......
    Posted in the Calculus Forum
    Replies: 2
    Last Post: Jan 3rd 2008, 03:31 PM

Search Tags

/mathhelpforum @mathhelpforum