NFAs to DFAs

Discussion in 'Computer Science & Culture' started by TripleBeem1, Mar 15, 2003.

Thread Status:
Not open for further replies.
  1. TripleBeem1

    TripleBeem1 Registered Member

    Messages:
    2
    Does anyone know how to turn a non-deterministic finite state automaton into a deterministic finite state automaton using a transition table and transition graphs?
     
    TripleBeem1, Mar 15, 2003
    #1

  2. Google AdSense Guest Advertisement



    to hide all adverts.
  3. Rick

    Rick ॐ Valued Senior Member

    Messages:
    3,336
    Please Consult a Book called "Introduction To Computer Theory"


    By Daniel I.A.Cohen



    if you still dont get it,ask me.

    bye!
     
    Rick, Mar 15, 2003
    #2

  4. Google AdSense Guest Advertisement



    to hide all adverts.
  5. TripleBeem1

    TripleBeem1 Registered Member

    Messages:
    2
    Thank you for your reply. It's greatly appreciated. Would it be possible if you can just answer the question I have asked because the library does not seem to have the book you refered. I have consulted many computer science books but they do not specify an answer pertaining to my inquiry.
     
    TripleBeem1, Mar 15, 2003
    #3

  6. Google AdSense Guest Advertisement



    to hide all adverts.
Thread Status:
Not open for further replies.

Share This Page