Skip to main content

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.
Labels:

Comments

Post a Comment

Popular posts from this blog

Theory of Automata Assignment #2 Part #2 Regular Expression # 6 The set of strings over {a,b} that contain at least two a's or exactly two b's. (a+b)*(a)(b*)a(a+b)*+a*b(a*)b(a*) Regular Expression # 7 The set of strings over {a,b} that contain even length but not multiple of 3 (aa*)(aaa^) Regular Expression # 8 The language over {a,b}contains exactly one double letter.   (ε + b)(ab) ∗aa(ba) ∗(ε + b) + (ε + a)(ba) ∗ bb(ab) ∗(ε + a)
Post a Comment
Read more

Data Types in C++

Hello azumavenger welcome to my blog. Today we are going to talk about the data types. Data Types in C++ Actually the data type tells the compiler or the interpreter that in which mean the programmer intends to use the data. That sounds confusing right? Well their is nothing to be confused of, most of the people use the word data type and they know what it is but they can't explain it in simple words.  Lets have an example. A student Kutbud'deen wrote the following code #include <iostream> using   namespace  std; void  main() {   int  var1 = 0; //integer    char  var2 =  '0' ; //character   if  (var1 == 0){ cout <<  "var1" ; }   else   if  (var2 == 0){ cout <<  "var2" ; }   else  { cout <<  "no one" ; }   system( "pause" ); } The...
Post a Comment
Read more

TA ASSIGNMENT 1 PART 3

Theory of Automata Assignment #1 Part #3 Recursive Definition #11: Language of Expressions having at least one operator defined on  Σ ={+,-,*,/,a,b}  Step 1#- a+b ,a*b,a/b and a-b are in L Step 2#- If x is in L then x+x,x-x,x*x,x/x is also in L Step 3#- No words except generated above can be considered as member of Language. Recursive Definition #12: Language of string starting and ending on different alphabet defined on  Σ ={a,b} Step 1#- ab and ba are in L Step 2#- If x is in L then axb,and bxa are also in  Σ*.   Step 3#- No words except generated above can be considered as member of Language. Recursive Definition #13: Language of even numbers Step 1#- 0 and 2 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. Recursive Definition #14: Language of negative integers d...
Post a Comment
Read more