Posts

Showing posts from January 30, 2011

Finite Automata Solution

Image
Finite Automata Solution (1) L = { x | x start with 110 }



(2)L = { x | x end with 1011 }


(3) L = { x | x contains substring 010 }


(4) L = { x | x does not start with 10 }



(5) L = { x | x does not end with 001 }


(6) L = { x | x does not contain substring 1010 }



Finite Automata Example

Finite Automata Example for Practice at Home
 Draw / Construct DFA for following Language over alphabet { 0, 1 }
·L = { x | x start with 110 }
·L = { x | x end with 1011 }
·L = { x | x contains substring 010 }
·L = { x | x does not start with 10 }
·L = { x | x does not end with 001 }
·L = { x | x does not contain substring 1010 }
·L1 = { x | x contain substring 00 }
L2     L2 = { x | x end with 10 }        (a) L1 U L2    (b) L1 П L2  (c) L1 – L2  (d) L1' U L2
**Answer will be uploaded soon on blog.