24-10-2016, 02:40 PM
1460831488-TOCSecondAssignment.doc (Size: 34.5 KB / Downloads: 6)
(1) Define following:
1. Finite automata.
2. Acceptance by an FA.
(2) Give a DFA for the following languages.The alphabet is ∑ = {0, 1,2}.
1. Begins with 0 or ends with 0 but not both.
2. Contains the pattern 01 at least twice.
3. Ends with 0 and only contains multiples of strings 111 or 100.
4. Do not contain substring 10.
(3) Give a DFA for the following languages.
1. {00}*{11}*
2. {a,b}*{baaa}
3. {11,110}*0
4. Strings containing odd number of 0’s and odd number of 1’s.
5. Strings with next to last symbol 0
6. Strings with length > = n and the nth symbol from right is 1. (For n=2 and n=3).