National College of

Business Administration & Economics

Theory of Automata
Assignment No. 1

Question:

1. Create RE, DFA, NFA according to the given conditions over the  ={a,b}.
I. All words ending with b
II. All words that start with a
III. All words that start with a double letter
IV. All words that contain at least one double letter
V. All words that start and end with a double letter
VI. All words of length >=3
VII. All words that contain exactly one a or exactly one b
VIII. All words that don’t end at b

2. Create RE, DFA, NFA according to the given conditions over the alphabet {0, 1}.
I. { w | w begins with a ‘1’ and ends with a ‘0’ }
II. { w | w contains exactly three 1’s}
III. { w | w contains at least three 1’s}
IV. { w | w is a string that begin with a ‘1’ and contain exactly two 0’s }

3. Create RE, DFA, NFA according to the given conditions.

I. { w ε {0,1}* | w contains the substring 01 }
II. { w ε ∑* | w contains the substring 01 }
III. {w in {0,1}* | second symbol of w is a 1}
IV. { w ε {0,1}* | |w| < 4 }

4. Define RE, DFA, NFA language for.

I. {w in {a,b}* | |w| is odd }.
II. {w in {a,b}* | w does not have ab as a substring}.

5. Create RE, DFA, NFA according to the given conditions over the  ={a,b}.
I. The language of all strings, not beginning with b
II. All words that contain at least one double letter
III. All words that contain at least two a’s or two b’s
IV. All words that start and end with a double letter
V. All words of length >=3
VI. All words that contain exactly one a or exactly one b
VII. All words that don’t end at ba
VIII. All strings of a’s and b’s in which either the strings are all b’s or else there is an a followed
by some b’s
IX. Language of all words that have at least two a’s

1
 National College of
Business Administration & Economics

X. Language of all words that have at least one a and at least one b
XI. Language of all words that have at least one a or at least one b
XII. The languages L, of even length, defined over Σ = {a, b}
XIII. The languages L, of odd length, defined over Σ = {a, b}
XIV. The strings of length 2, starting with a
XV. Language of string begins and end with 110
XVI. The language of all the words with exactly two b’s or exactly two a’s
6. Create RE, DFA, NFA for.
I. The language L of strings of odd length, defined over Σ={a}
II. The language L of strings that does not start with a, defined over Σ={a,b,c}
III. The language L of strings of length 2, defined over Σ={0,1,2}
IV. The language L of strings ending in 0, defined over Σ ={0,1}
V. The language EQUAL, of strings with number of a’s equal to number of b’s, defined over
Σ={a,b}
VI. The language EVEN-EVEN, of strings with even number of a’s and even number of b’s,
defined over Σ={a,b}
VII. The language INTEGER, of strings defined over Σ={-,0,1,2,3,4,5,6,7,8,9}
VIII. The language EVEN, of stings defined over Σ={-,0,1,2,3,4,5,6,7,8,9}
IX. The language {anbn }, of strings defined over Σ={a,b}
X. The language {anbnan }, of strings defined over Σ={a,b}, [where n=1,2,3,…]
XI. The language factorial, of strings defined over Σ={1,2,3,4,5,6,7,8,9}
XII. The language FACTORIAL, of strings defined over Σ={a}, as {an! : n=1,2,3,…}
XIII. The language DOUBLEFACTORIAL, of strings defined over Σ={a, b}, as {an!bn! :
n=1,2,3,…}
XIV. The language SQUARE, of strings defined over Σ={a}, as {an 2 : n=1,2,3,…}
XV. The language DOUBLESQUARE, of strings defined over Σ={a,b}, as {an 2 bn 2 : n=1,2,3,…}
XVI. The language PRIME, of strings defined over Σ={a}, as {ap : p is prime}

Instructions:
i. Hard copy of assignment is required (Hand Written).

GOOD LUCK
2