Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
32 views2 pages

Tutorial 3

The document contains questions about regular languages and regular expressions including definitions of acceptors, generators, and representators. It also asks questions about regular grammars, operators in regular expressions, primitive regular expressions, and forming languages from given regular expressions.

Uploaded by

Aryan Kothari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views2 pages

Tutorial 3

The document contains questions about regular languages and regular expressions including definitions of acceptors, generators, and representators. It also asks questions about regular grammars, operators in regular expressions, primitive regular expressions, and forming languages from given regular expressions.

Uploaded by

Aryan Kothari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial -3 ​ (18/9/2020)

1. What are ​acceptors​? What is an ​acceptor and generator and


representator in the context of regular language?

2. Give the classification of ​Finite Automata​?

3. Regular grammars are of two types namely ___________ and


_____________

4. What are the operators that Regular Expression contains?

5. What are primitive Regular Expressions?

6. If r1 and r2 regular expression, are the following would be a regular


expression
a. r1+r2
b. r1.r2
c. r1*

7. Form the languages for the following regular expression: ​Ф (fi), ∈, a,


a*, a+, and (a+b)*

8. Write the regular expression for the language having a string that
should have at least one 0 and at least one 1.

9. Concatenation of R with Ф outputs:


a. R
b. Ф
c. R.Ф
d. None of the mentioned
10. Describe the language denoted by following regular expression
r.e. = (b* (aaa)* b*)*

11. Which of the following languages is generated by given grammar?


S -> aS | bS | ∊

a) {a​n​ b​m​ | n,m ≥ 0}


b) {w ∈ {a,b}* | w has equal number of a’s and b’s}
c) {a​n​ | n ≥ 0} ∪ {b​n​ | n ≥ 0} ∪ {a​n​ b​n​ | n ≥ 0}
d) {a,b}*

​Questions to solve within 20/9/2020 (Sunday)


-----------------------------------------------------------------
1. Design a NFA from given regular expression 10 + (0 + 11)0* 1

2. True or False: Give a proper explanation for your answer.


“If L is a regular language and F is a finite language (i.e., a language with
a finite number of words), then (L ​U​ F) must be a regular language”

3. If L1 = {a​n ​| n ≥ 0} and L2 = {b​n ​| n ≥ 0}, consider


i) L1.L2 is a regular language.
ii) L1.L2 = {a​n ​b​n ​| n ≥ 0}
Which one is correct? Explain.

4. Find regular grammar for given languages:


i) L (G) = {a​m​ b​n​ | m ≥ 0 and n > 0}
ii) L (G) = {a​m​ b​n​ | m > 0 and n ≥ 0}
iii) L (G) = {a​m​ b​n​ | m ≥ 0 and n ≥ 0}
iv) L (G) = {a​m​ b​n​ | m > 0 and n > 0}
v) L (G) = {a​m​ b​n​ | m > 0 or n > 0}

You might also like