QuestionNo.1 Marks:4 a) Give regular expressions of thefollowing languages over
ID: 3618326 • Letter: Q
Question
QuestionNo.1 Marks:4
a) Give regular expressions of thefollowing languages over ={0,1}:
1. All strings having no pair ofconsecutive zeros.
2. All strings having exactly two1’s or three 1’s not more than it.
b) Show that the Regularexpression ^ + 0(0+1)*+(0+1)*00(0+1)* is equivalent to ((0*1)*01*)*
Question No.2 Marks: 4
a) Give recursive definition forthe language ODD, of strings defined over?={-,0,1,2,3,4,5,6,7,8,9},
b) Give recursive definition forthe language of palindromes having odd length
Question No.3 Marks: 6
Three Finite Automata (FAs) have been given below:
FA1
FA3
Match the following Regular Expressions (RE’s) withcorresponding Finite Automata (FA’s) given above. Alsodescribe their languages (in English).
Regular Expression
Finite Automaton (FA)
Language Description
a(aa)*(^+a)b+b
aa*b(aa*b)*
(a+b)*a(a+b)*b(a+b)*
Question No.4 Marks: 6
Build an FA over ={a, b} that accepts only those wordsthat do not contain the substring “ba”.
Also make transition table for that FA.
Deadline
Your assignment must be uploaded/submitted on or beforeApril 28, 2010
QuestionNo.1 Marks:4
a) Give regular expressions of thefollowing languages over ={0,1}:
1. All strings having no pair ofconsecutive zeros.
2. All strings having exactly two1’s or three 1’s not more than it.
b) Show that the Regularexpression ^ + 0(0+1)*+(0+1)*00(0+1)* is equivalent to ((0*1)*01*)*
Question No.2 Marks: 4
a) Give recursive definition forthe language ODD, of strings defined over?={-,0,1,2,3,4,5,6,7,8,9},
b) Give recursive definition forthe language of palindromes having odd length
Question No.3 Marks: 6
Three Finite Automata (FAs) have been given below:
FA1
FA3
Match the following Regular Expressions (RE’s) withcorresponding Finite Automata (FA’s) given above. Alsodescribe their languages (in English).
Regular Expression
Finite Automaton (FA)
Language Description
a(aa)*(^+a)b+b
aa*b(aa*b)*
(a+b)*a(a+b)*b(a+b)*
Question No.4 Marks: 6
Build an FA over ={a, b} that accepts only those wordsthat do not contain the substring “ba”.
Also make transition table for that FA.
Deadline
Your assignment must be uploaded/submitted on or beforeApril 28, 2010
Explanation / Answer
QuestionNo.1 Marks:4
a) Give regular expressions of thefollowing languages over ={0,1}:
1. All strings having no pair ofconsecutive zeros.
2. All strings having exactly two1’s or three 1’s not more than it.
b) Show that the Regularexpression ^ + 0(0+1)*+(0+1)*00(0+1)* is equivalent to ((0*1)*01*)*
Question No.2 Marks: 4
a) Give recursive definition forthe language ODD, of strings defined over?={-,0,1,2,3,4,5,6,7,8,9},
b) Give recursive definition forthe language of palindromes having odd length
Question No.3 Marks: 6
Three Finite Automata (FAs) have been given below:
FA1
FA3
Match the following Regular Expressions (RE’s) withcorresponding Finite Automata (FA’s) given above. Alsodescribe their languages (in English).
Regular Expression
Finite Automaton (FA)
Language Description
a(aa)*(^+a)b+b
aa*b(aa*b)*
(a+b)*a(a+b)*b(a+b)*
Question No.4 Marks: 6
Build an FA over ={a, b} that accepts only those wordsthat do not contain the substring “ba”.
Also make transition table for that FA.
Deadline
Your assignment must be uploaded/submitted on or beforeApril 28, 2010
QuestionNo.1 Marks:4
a) Give regular expressions of thefollowing languages over ={0,1}:
1. All strings having no pair ofconsecutive zeros.
2. All strings having exactly two1’s or three 1’s not more than it.
b) Show that the Regularexpression ^ + 0(0+1)*+(0+1)*00(0+1)* is equivalent to ((0*1)*01*)*
Question No.2 Marks: 4
a) Give recursive definition forthe language ODD, of strings defined over?={-,0,1,2,3,4,5,6,7,8,9},
b) Give recursive definition forthe language of palindromes having odd length
Question No.3 Marks: 6
Three Finite Automata (FAs) have been given below:
FA1
FA3
Match the following Regular Expressions (RE’s) withcorresponding Finite Automata (FA’s) given above. Alsodescribe their languages (in English).
Regular Expression
Finite Automaton (FA)
Language Description
a(aa)*(^+a)b+b
aa*b(aa*b)*
(a+b)*a(a+b)*b(a+b)*
Question No.4 Marks: 6
Build an FA over ={a, b} that accepts only those wordsthat do not contain the substring “ba”.
Also make transition table for that FA.
Deadline
Your assignment must be uploaded/submitted on or beforeApril 28, 2010
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.