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?
  3. Draw a state machine stable based on this diagram.
Author
ccc
ID
342716
Card Set
1.4 Language Recognition
Description
:))
Updated