CS402 Theory of Automata assignment no 1 spring fall October 2011

[Vuhelper]

[FONT=&quot] [/FONT]

[FONT=&quot]Theory of Automata[/FONT]

[FONT=&quot]CS402[/FONT][FONT=&quot][/FONT]

[FONT=&quot]ASSIGNMENT NO.1[/FONT]

Total Marks= 20 (4+4+4+4+4)

[FONT=&quot]Assignment Submission Deadline[/FONT]

Your assignment must be uploaded before or on 31-10-2011 [upload your assignment well before due date to avoid any assignment uploading related issues]

[FONT=&quot]Rules for Marking[/FONT]

It should be clear that your assignment will not get any credit if:

• The assignment is submitted after due date
  
• The assignment is copied
  

[FONT=&quot]Objectives[/FONT]

Objectives of this assignment are to make students able to understand the following concepts,

• Basic concepts clarification
  
• Recursive Definition of a language
  
• Regular Expression
  
• Finite Automata
  

[FONT=&quot]Question No.1 Basic Concepts [Sets, Letters, Valid Alphabet, Languages, Strings and Words] [/FONT]

a. Which of the following are strings generated from alphabet Σ = {a, b}
i. abba
ii. baa$a
iii. abc.
iv. ba?
v. b.bba
b. Which of the following are valid words for language of all strings ending with bab defined for alphabet Σ = {a, c , bab}
i. acccba
ii. cccbaa
iii. cccbab
iv. babbb
v. baaab


[FONT=&quot]Question No.2 Defining Languages [Using Recursive Definition, Re’s, Fa’s][/FONT]

Give recursive definitions of following languages defined over alphabet Σ = {a, b}

1. Having all strings starting with b and having length greater than 2
   
2. NOT having ab at any place.
   

[FONT=&quot]Question No.3 Regular Expressions[/FONT]

Give Regular Expression for each of the following language defined over alphabet Σ = {a, b}

1. Even Length strings ending with b
   
2. Strings with b’s count multiple of three
   

[FONT=&quot]Question No.4 Models To Recognize Languages (Fa’s)[/FONT]

Give Finite Automata (FA) for each of the following language defined over alphabet Σ = {a, b}

1. Language having all strings NOT containing aa at any place
   
2. Language of all strings NOT STARTING with bb
   

[FONT=&quot]Question No.5 Models To Recognize Languages (Nfa’s)[/FONT]

Give Non Deterministic Finite Automata (NFA) for each of the following language defined over alphabet Σ = {a, b}

1. Language of all strings STARTING WITH bba
   
2. Language having all strings NOT having even no of a’s and b’s
   

[ffaizan]

wae soultion das

[rabeel]

Dear wait will upload soon. Thora sabar

[ffaizan]

yar bhai abi tak ni how????????????????????????????

[sadia bukhsh]

Dear ap nay sta301 ka solution bi nai dia ab please cs402 ka to day dain

[rabeel]

Acha is ka tu asan sa hi hai. example hai ek bus.

[ffaizan]

bhai asan tu hy he upload tu kr daein

[rabeel]

okkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk

[safdar548]

i am safdar dogar now i come vu assignment no problem
safdar dogar
sardar548@gmail.com