Scribd
Upload
39 views3 pages

Btech - CS3404 - Theory of Automata - Unit 2

Uploaded by

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

Btech - CS3404 - Theory of Automata - Unit 2

Uploaded by

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

MFT

(1) Assume the R is a relation on a set A, aRb is partially ordered such that a and b are
_____________
a) reflexive
b) transitive
c) symmetric
d) reflexive and transitive

(2) A regular language over an alphabet ∑ is one that cannot be obtained from the basic
languages using the operation
a) Union
b) Concatenatio
c) Kleene*
d) All of the mentioned

(3) The minimum number of states required to recognize an octal number divisible by 3
are/is
a) 1
b) 3
c) 5
d) 7
(4) The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2}
and ∑={0,1} is_________
a) 7
b) 6
c) 8
d) 5

(5) Given: ∑= {a, b} L= {xϵ∑*|x is a string combination} ∑4 represents ∑4 represents which


among the following? which among the following? advertisement
a) {aa, ab, ba, bb}
b) {aaaa, abab, ε, abaa, aabb}
c) {aaa, aab, aba, bbb}
d) All of the mentioned

(6) The Grammar can be defined as: G=(V, ∑, p, S). In the given definition, what does S
represents?
a)Accepting State
b)Starting Variable
c)Sensitive Grammar
d) None of these

(7) State true or false:


Statement: R->R|T T->ε is an ambiguous grammar
a) true c)cant’say
b) false d) may be

(8) What is the output for the given language? Language: A set of strings over ∑= {a, b} is
taken as input and it prints 1 as an output “for every occurrence of a, b as its substring.
(INPUT: abaaab)

a) 0010001
b) 0101010
c) 0111010
d) 0010000

(9) A Language for which no DFA exist is a________


a) Regular Language
b) Non-Regular Language
c) May be Regular
d) Cannot be said

(10) When are 2 finite states hen are 2 finite states equivalent?
a) Same number of transitions
b) Same number of states
c) Same number of states as well as transitions
d) Both are final states

Long Answer
(11) Define grammar? Explain Chomsky Hierarchy? Give an example
(12) Define regular sets. List out closure properties of regular sets
(13) Obtain a grammar to generate the following language L ={WWR Where W {a,
b}*}..
(14) Define regular expressions. Give RE for the following over ∑= {0,1} i. All binary
strings with at least one 0. ii. All binary strings with at most one 0.
(15) Construct a FA for given regular expression (10)* 101(01)*.
(16) Write formal definition of regular expression with suitable example. State
Arden’s theorem and its use.
(17) Explain properties of regular expression.
(18) Show that (a* b*)*=(a +b)*
(19) Construct NFA for following regular expressions.
i. a * b (a + b)* ii. (aa + bb)* bb (a + b)*
(20) Consider the following DFA , Minimization of This DFA using myhill nerode
theorem.
(21) Construct DFA for the R.E l0 + (0 + ll)
(22) State the pumping lemma theorem for regular sets. Show that the language L =
{0n | n is prime} is not regular
(23) Consider the following DFA , Minimization of This DFA

(24) Define the following with suitable examples


i. FA ii. Regular Expression
(25) Construct DFA for regular expression (a + b)* abb

You might also like