adplus-dvertising
frame-decoration

Question

Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}.
Which of the following property satisfy the regularity of the given language?

a.

Regularity is dependent upon the length of the string

b.

Regularity is not dependent upon the length of the string

c.

Can’t be said for a particular string of a language

d.

It may depend on the length of the string

Answer: (b).Regularity is not dependent upon the length of the string

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}. Which of the following property satisfy the regularity of the given language?

Similar Questions

Discover Related MCQs

Q. Given:
L= {xϵ∑= {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?

Q. How many languages are over the alphabet R?

Q. According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}
Statement 1: q ϵ Q’;
Statement 2: FϵQ

Q. δˆ tells us the best:

Q. Which of the following option is correct?
A= {{abc, aaba}. {ε, a, bb}}

Q. For a DFA accepting binary numbers whose decimal equivalent is divisible by 4, what are all the possible remainders?

Q. Given:
L1= {xϵ ∑*|x contains even no’s of 0’s}

L2= {xϵ ∑*|x contains odd no’s of 1’s}

Nunber of final states in Language L1 U L2?

Q. The maximum number of transition which can be performed over a state in a DFA?
∑= {a, b, c}

Q. The maximum sum of in degree and out degree over a state in a DFA can be determined as:
∑= {a, b, c, d}

Q. The sum of minimum and maximum number of final states for a DFA n states is equal to:

Q. There are ________ tuples in finite state machine.

Q. Transition function maps.

Q. Number of states require to accept string ends with 10.

Q. Extended transition function is .

Q. δ*(q,ya) is equivalent to .

Q. String X is accepted by finite automata if .

Q. Languages of a automata is

Q. Language of finite automata is.

Q. Finite automata requires minimum _______ number of stacks.

Q. Number of final state require to accept Φ in minimal finite automata.