Hey there! Sign in to join this conversationNew here? Join for free
    • Thread Starter
    Offline

    6
    ReputationRep:
    Currently studying Finite-state automata, and I'm having some trouble understanding how the method to translate an FSA that uses epsilon into one that doesn't works.

    So let's say we have the automata shown below:



    The first step is easy enough: just creating a transition table for the automata.
    The second stage, adding the ε*, I understand too.
    The third stage is where I have a question. As the table for the third stage shows below:

    *If the image above is not viewable (forum refuses to show it for some reason) then refer to http://imgur.com/a/i2ZYo for the image.

    I'm unsure what the set inputs are meant to represent. So for instance the first input (left q0, top a) which, after taking 0 ε, q0 can take the input a. But does this input of {q0} represent where the FSA is after taking a? Or does it show just what it can take after taking ε?

    The example FSA doesn't make this clear, as after taking a, q0 will still be on q0, so I'm unsure if this means that the input on the table is where it ends up after taking the input or just what it is able to take.

    Thanks. All help appreciated!
 
 
 
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • Poll
    Did TEF Bronze Award affect your UCAS choices?
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

    Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

    Quick reply
    Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.