Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by vikasgupta24697
2
answers
1
CMI2019-A-2
Let $A$ be an $NFA$ with $n$ states. Which of the following is necessarily true? The shortest word in $L(A)$ has length at most $n-1.$ The shortest word in $L(A)$ has length at least $n.$ The shortest word not in $L(A)$ has length at most $n-1.$ The shortest word not in $L(A)$ has length at least $n.$
Let $A$ be an $NFA$ with $n$ states. Which of the following is necessarily true?The shortest word in $L(A)$ has length at most $n-1.$The shortest word in $L(A)$ has lengt...
862
views
commented
Sep 18, 2019
Theory of Computation
cmi2019
finite-automata
+
–
3
answers
2
CMI2019-A-1
Let $L_{1}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m\geq n\}$ and $L_{2}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m < n\}.$ The language $L_{1}\cup L_{2}$ is: regular, but not context-free context-free, but not regular both regular and context-free neither regular nor context-free
Let $L_{1}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m\geq n\}$ and $L_{2}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m < n\}.$The language $L_{1}\cup L_{2}$ is:regular...
878
views
commented
Sep 18, 2019
Theory of Computation
cmi2019
regular-language
context-free-language
closure-property
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register