Showing posts with label automata theory. Show all posts
Showing posts with label automata theory. Show all posts

Thursday 16 May 2019

Equivalance NFA to DFA 1


 
Equivalance

 

Design Non-Deterministic Finite Automata 2

The next...
We can also make a design NFAs with 2 states and the rules are: strings that can be received must start with '0'.
Examples of acceptable strings:
  • '0', 
  • '00', 
  • '01',
  • '0 *', 
  • '01 * ', 
  • '01 * 0 *',
  • '0 * 1 *', ...
The Answer:

 
Design the NFA

                                                     Transition Table

Design Non-Deterministic Finite Automata 1

We can design the NFA with 3 states and the rule is: the string that can be received must end in 'ab'.
Examples of strings that can be accepted: 

  • 'ab', 
  • 'aab', 
  • 'a * ab', 
  • 'bab',
  • 'b * ab', 
  • 'abab', 
  • 'a * b * ab', 
  • 'b * a * ab '
The  Answer: 

 

Design the NFA