Test: Simpler Notations - Computer Science Engineering (CSE) MCQ
10 Questions MCQ Test Theory of Computation - Test: Simpler Notations
Given Language: L= {xϵ∑= {a, b} |x has a substring ‘aa’ in the production}. Which of the corresponding representation notate the same?
the row and column. The row represents the transitions made and the ultimate.2.Let u=’1101’, v=’0001’, then uv=11010001 and vu= 00011101.Using the given information what is the identity element for the string?
Which of the following substring will the following notation result?
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 < _______________
Fill the missing blank in the given Transition Table:
Language L= {xϵ∑= {0,1} |x accepts all the binary strings not divisible by 3}
.Which among the following is the missing transition in the given DFA?
L= {xϵ∑= {a, b} | x starts with a and ends with b}
The complement of a language will only be defined when and only when the __________ over the language is defined.
Which among the following is not notated as infinite language?
Which among the following states would be notated as the final state/acceptance state?L= {xϵ∑= {a, b} | length of x is 2}
Which of the following are the final states in the given DFA according to the Language given.?
L= {xϵ∑= {a, b} |length of x is at most 2}
|
18 videos|70 docs|44 tests
|
Important Questions for Simpler Notations
Simpler Notations MCQs with Answers
Online Tests for Simpler Notations Theory of Computation
|
© EduRev
|
Education Revolution
|
|
