Q. L is a regular Language if and only If the set of __________ classes of L is finite.

View solution

Q. A language can be generated from simple primitive language in a simple way if and only if

View solution

Q. Which of the following does not represents the given language?
Language: {0,01}

View solution

Q. According to the given language, which among the following expressions does it corresponds to?
Language L={xϵ{0,1}|x is of length 4 or less}

View solution

Q. Which among the following looks similar to the given expression?
((0+1). (0+1)) *

View solution

Q. Concatenation Operation refers to which of the following set operations:

View solution

Q. Concatenation of R with Ф outputs:

View solution

Q. RR* can be expressed in which of the forms:

View solution

Q. A finite automaton accepts which type of language:

View solution

Q. Which among the following are incorrect regular identities?

View solution

Q. Simplify the following regular expression:
ε+1*(011) *(1*(011) *) *

View solution

Q. P, O, R be regular expression over ∑, P is not ε, then
R=Q + RP has a unique solution:

View solution

Q. Arden’s theorem is true for:

View solution

Q. The difference between number of states with regular expression (a + b) and (a + b) * is:

View solution

Q. In order to represent a regular expression, the first step to create the transition diagram is:

View solution

Q. (0+ε) (1+ε) represents

View solution

Q. The minimum number of states required to automate the following Regular Expression:
(1) *(01+10) (1) *

View solution

Q. Regular Expression denote precisely the ________ of Regular Language.

View solution

Q. Which of the following is correct?
Statement 1: ε represents a single string in the set.

Statement 2: Ф represents the language that consist of no string.

View solution

Q. The appropriate precedence order of operations over a Regular Language is

View solution