Given:L= {x = {0,1} |x=0n1n for n>=1}; Can there be a DFA possible fo – McqOptions

MCQOPTIONS

1.	Given: L= {x = {0,1} \|x=0n1n for n>=1}; Can there be a DFA possible for the language?
A.	Yes
B.	No
Answer» C.

Discussion

No Comment Found

Related MCQs

Given:<br>L= {x = {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?
Given L= {X *= {a, b} |x has equal number of a, s and b s}.<br> Which of the following property satisfy the regularity of the given language?
For the DFA given below compute the following:<br>Union of all possible combinations at state 7,8 and 9.
Let = {a, b, . z} and A = {Hello, World}, B= {Input, Output}, then (A* B) U (B* A) can be represented as:
The password to the admins account= administrator . The total number of states required to make a password-pass system using DFA would be __________