adplus-dvertising
frame-decoration

Question

Arden’s theorem is true for:

a.

More than one initial states

b.

Null transitions

c.

Non-null transitions

d.

None of the mentioned

Answer: (c).Non-null transitions

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Arden’s theorem is true for:

Similar Questions

Discover Related MCQs

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

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

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

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

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

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.

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

Q. Regular Expression R and the language it describes can be represented as:

Q. Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be

Q. If ∑= {0,1}, then Ф* will result to:

Q. The given NFA represents which of the following NFA

Q. Which of the following represents a language which has no pair of consecutive 1’s if ∑= {0,1}?

Q. The finite automata accept the following languages:

Q. (a + b*c) most correctly represents:

Q. Which of the following regular expressions represents the set of strings which do not contain a substring ‘rt’ if ∑= {r, t}

Q. According to the precedence rules, x-y-z is equivalent to which of the following?

Q. Dot operator in regular expression resembles which of the following?

Q. Which among the following is not an associative operation?

Q. Which among the following is equivalent to the given regular expression?
01*+1

Q. The total number of states required to automate the given regular expression
(00)*(11)*