1. Home
  2. Flashcards
  3. Preview

1.4 Language Recognition

  1. When are two inputs into a state machines without output seen as equivalent?
    When are they seen as accepted rejected?
    • Accepted if they take the path from the staring state and end on an accepted end state.
    • They are seen as equivalent, the input strings, if they both have the same end state, either accepted or rejected.
  2. How do we define a non deterministic machine?
    Image Upload 2
  3. Draw a state machine stable based on this diagram. Image Upload 4
    Image Upload 6
  4. Image Upload 8
    Image Upload 10
  5. Image Upload 12
    Image Upload 14
  6. Image Upload 16
    Image Upload 18
  7. Image Upload 20
    Image Upload 22
  8. Image Upload 24
    Image Upload 26
  9. Image Upload 28
    Image Upload 30
  10. Image Upload 32
    Image Upload 34
  11. Image Upload 36
    Image Upload 38 Image Upload 40
  12. Image Upload 42
    Image Upload 44
Author
ccc
ID
342716
Card Set
1.4 Language Recognition
Description
:))
Updated

  1. Home
  2. Flashcards
  3. Preview