Assignment #1 :- Theory of Automata

Muneeb Ahmad Mirza

081216
BSCS-6

1- Descriptive definition of language Example

The language L of strings of length 2, defined over Σ ={0,1,2}, can be written as

L= {00, 01, 02,10, 11,12,20,21,22}
2- Recursion Example
The set POLYNOMIAL is defined by these four rules:

Rule 1 Any number is in POLYNOMIAL.

Rule 2 The variable x is in POLYNOMIAL.
Rule 3 If p and q are in POLYNOMIAL, then so are p + q and (p) and pq.
Rule 4 POLYNOMIAL contains only those things which can be created by the
three rules above.
3- Regular Expression Example
The language of the expression a*b*
contains all the strings of a's and b's in which all the a's (if any) come before
all the b's (if any).
language (a*b*) = {A a b aa ab bb aaa aab abb bbb aaaa . . . }

4- Example of Graph