MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
a ^ nb ^ n where (n+m) is even ...
1.
a ^ nb ^ n where (n+m) is even .
A.
Type 0
B.
Type 1
C.
Type 2
D.
Type 3
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
a ^ nb ^ m where n >= 1, m >= 1, nm >= 3 is example of
Complement of a ^ nb ^ m where n >= 4 and m <= 3 is example of
a ^ nb ^ n where (n+m) is even .
Which of the following is type 3 language ?
(a ^ 5b ^ 5)* is example of ________
Homomorphism of a regular set is _______
A ___________ is a substitution such that h(a) contains a string for each a.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply