MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
Which among the following is not notated as infini...
1.
Which among the following is not notated as infinite language?
A.
Palindrome
B.
Reverse
C.
Factorial
D.
L={ab}*
Answer» D. L={ab}*
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which among the following states would be notated as the final state/acceptance state?L= {x = {a, b} | length of x is 2}
Which among the following is not notated as infinite language?
The complement of a language will only be defined when and only when the __________ over the language is defined.
Which among the following is the missing transition in the given DFA?L= {x = {a, b} | x starts with a and ends with b}
Fill the missing blank in the given Transition Table:Language L= {x = {0,1} |x accepts all the binary strings not divisible by 3}
4.Predict the following step in the given bunch of steps which accepts a strings which is of even length and has a prefix= 01 (q0, ) =q0 < (q0,0) = ( (q0, ),0) = (q0,0) =q1 < _______________
2.Let u= 1101 , v= 0001 , then uv=11010001 and vu= 00011101.Using the given information what is the identity element for the string?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies