Scribd
Upload
12 views7 pages

8-RLDecision ClosurePropertywithkey

gate notes

Uploaded by

adarsh gupta
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
12 views7 pages

8-RLDecision ClosurePropertywithkey

gate notes

Uploaded by

adarsh gupta
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/ 7

Decision properties

• Approximately all the properties are decidable in case a finite automaton. Here we will use
machine model to proof decision properties.

i) Emptiness
ii) Non-emptiness
iii) Finiteness
iv) Infiniteness
v) Membership
vi) Equality
• Emptiness & Non-emptiness
Step 1: - select the state that cannot be reached from the initial states & delete them (remove
unreachable states)

Step 2: - if the resulting machine contains at least one final states, so then the finite automata
accepts the non-empty language.

Step 3: - if the resulting machine is free from final state, then finite automata accepts empty
language.

• Finiteness & Infiniteness


Step 1: - select the state that cannot be reached from the initial state & delete them (remove
unreachable states)

Step 2: - select the state from which we cannot reach the final state & delete them (remove
dead states)

Step 3: - if the resulting machine contains loops or cycles then the finite automata accepts
infinite language

Step 4: - if the resulting machine do not contain loops or cycles then the finite automata
accepts infinite language

• Membership
Membership is a property to verify an arbitrary string is accepted by a finite automaton or
not i.e. it is a member of the language or not.

Let M is a finite automata that accepts some strings over an alphabet, and let ‘w’ be any
string defined over the alphabet, if there exist a transition path in M, which starts at initial
state & ends in anyone of the final state, then string ‘w’ is a member of M, otherwise ‘w’ is
not a member of M.

• Equality
Two finite state automata M1 & M2 is said to be equal if and only if, they accept the
same language.

Minimise the finite state automata and the minimal DFA will be unique.
Closure Properties of Regular Languages
• Regular languages are closed under following operations
o Kleen Closure
o Positive closure
o Complement
o Reverse Operator
o Prefix Operator
o Complement
o Union
o Intersection
o Set Difference operator
o Prefix operator
o Symmetric Difference
o Quotient Operator
o Substitution
o Homomorphism
o Inverse Homomorphism
o Max
o Min
o Cycle
Q Which of the following is TRUE? (GATE-2007) (2 Marks)
a) Every subset of a regular set is regular.
b) The union of two non-regular sets is not regular.
c) Every finite subset of a non-regular set is regular.
d) Infinite union of finite sets is regular
ANSWER C

Q Which of the following statements is false? (GATE – 1998) (1 Marks)

a) Every finite subset of a non – regular set is regular


b) Every subset of a regular set is regular
c) Every finite subset of a regular set is regular
d) The intersection of two regular sets in regular
Ans: b

Q Which of the following is TRUE? (GATE – 2007) (1 Marks)


a) Every subset of a regular set is regular
b) Every finite subset of a non-regular set is regular
c) The union of two non – regular sets is not regular
d) Infinite union of finite sets is regular
Ans: b

Q Which of the following statements about regular languages is NOT true? (GATE-2006) (1-
Marks)
a) Every language has a regular superset
b) Every language has a regular subset
c) Every subset of a regular language is regular
d) Every subset of a finite language is regular
Ans: c

Q Which of the following is true? (GATE – 2007) (1 Marks)


a) Infinite union of regular set is regular
b) The union of two non-regular net is not regular
c) finite union of infinite set is regular
d) every R.L is also C.F.L
Ans: b

Q Let 𝐿1 and 𝐿2 are regular sets defined over alphabet ∑*. Mark the false statement
a) 𝐿1 ∪ 𝐿2 is regular b) 𝐿1 ∩ 𝐿2 is not regular
c) ∑* -𝐿1 is regular d) 𝐿1 ∗ is regular

Q Which of the following statements are true?


i) The complement of a language is always regular
ii) The intersection of regular languages is regular
iii) The complement of a regular language is regular
a) i) and ii) only b) ii) and iii) only c) i) and iii) only d) All of the above
ANSWER: (B)

Q If L is a regular language over ∑ = {a, b}, which one of the following languages
is NOT regular? (GATE – 2019) (1 Marks)
a) L⋅ LR {xy | x ∈ L, yR∈ L}
b) Suffix (L) = {y ∈ ∑* | ∃x ∈ ∑* such that xy ∈ L}
c) Prefix (L) = {x ∈ ∑* | ∃y ∈ ∑* such that xy ∈ L}
d) {w wR | w ∈ L}
Answer: (B)

Q Consider the following two statements (GATE-2016) (1 Marks)


I. If all states of an NFA are accepting states then the language accepted by the NFA is Σ∗.
II. There exists a regular language A such that for all languages B, A ∩ B is regular.
Which one of the following is CORRECT?
(A) Only I is true (B) Only II is true
(C) Both I and II are true (D) Both I and II are false
Answer: (B)

Q The symmetric difference of two sets S1 and S2 is defined as


S1 ⊖ S2 = {x | x ∈ S1 or x ∈ S2, but x is not in both S1 and S2}
The nor of two languages is defined as nor (L1, L2) = {w | w |∈L1 and w |∈ L1}. Which of the
following is correct? (NET-JULY-2016)
a) The family of regular languages is closed under symmetric difference but not closed under
nor.
b) The family of regular languages is closed under nor but not closed under symmetric
difference.
c) The family of regular languages are closed under both symmetric difference and nor.
d) The family of regular languages are not closed under both symmetric difference and nor.
Ans: c

Q Consider the following two languages:


L1 = {0i1j| gcd (i, j) = 1}
L2 is any subset of 0*
Which of the following is correct? (NET-JULY-2016)
a) L1 is regular and L2* is not regular
b) L1 is not regular and L2* is regular
c) Both L1 and L2* are regular languages
d) Both L1 and L2* are not regular languages
Ans: b

Q Given L1=L(a*baa*) and L2=L(ab*). The regular expression corresponding to language


L3 = L1/L2 (right quotient) is given by (NET-JUNE-2013)
(A) a*b (B) a*baa* (C) a*ba* (D) None of the above

Q Let L1, L2 are regular languages and L3 & L4 are non-regular languages then which of the
following need not be regular?
a) (L1  L2) / (L3  L4) b) (L1  L2) / (L3  L4)
c) (L1  L3) / (L2  L4) d) L1 / L3

0𝑛 1𝑛
Q Let X = {0, 1}, L = X* and R = { > 0} then the language L ∪ R and R respectively
𝑛
a) Regular, Regular b) None regular, Regular
c) Regular, Not regular d) Not regular, Not regular

You might also like