MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
Given:..
1.
Given:
A.
B.
Yes
Answer» C.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
δ(A,1) = B, δ(A,0) =A Δ (B, (0,1)) =C δ(C,0) = A (Initial state =A)String=”011001” is transit at which of the states?
Given: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}. Which of the following property satisfy the regularity of the given language?
For the DFA given below compute the following:Union of all possible combinations at state 7,8 and 9.
Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization of DFA?
Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:
Which of the following is the corresponding Language to the given DFA?
The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________
δ(A,1) = B, δ(A,0) =?#
Given:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
