TA ASSIGNMENT 1 Part 2

Theory of Automata

Assignment #1

Part #2

Recursive Definition #6:

Language of whole numbers

Step 1#- 0 and 1 are whole numbers

Step 2#- If x is in L then x+1 is also in L

Step 3#- No words except generated above can be considered as member of                    Language.

Recursive Definition #7:

Language of string having two a's defined on Σ={a,b}

Step 1#- aa and aab are in L

Step 2#- If x is in Σ* then axa, aax and xaa are also in Σ* 

Step 3#- No words except generated above can be considered as member of                    Language.

Recursive Definition #8:

Language of string having at least one member defined on Σ={a,b}

Step 1#- a and b are in L

Step 2#- If x is in Σ* then ax and bx are also in Σ*. 

Step 3#- No words except generated above can be considered as member of                    Language.

Recursive Definition #9:

Language of negative integers defined on Σ={-1,-2,-3,-4,-5,-6,-7,-8,-9}

Step 1#- -1 and -2 are in L

Step 2#- If x is in L then x-1 is also in L. 

Step 3#- No words except generated above can be considered as member of                    Language.

Recursive Definition #10:

Language of odd numbers

Step 1#- 1 and 3 are in L

Step 2#- If x is in L then x+2 and x-2 is also in L. 

Step 3#- No words except generated above can be considered as member of                    Language.