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 1
  3. Draw a state machine stable based on this diagram. Image Upload 2
    Image Upload 3
  4. Image Upload 4
    Image Upload 5
  5. Image Upload 6
    Image Upload 7
  6. Image Upload 8
    Image Upload 9
  7. Image Upload 10
    Image Upload 11
  8. Image Upload 12
    Image Upload 13
  9. Image Upload 14
    Image Upload 15
  10. Image Upload 16
    Image Upload 17
  11. Image Upload 18
    Image Upload 19 Image Upload 20
  12. Image Upload 21
    Image Upload 22
Author
ccc
ID
342716
Card Set
1.4 Language Recognition
Description
:))
Updated