MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines in Automata Theory
→
If L is a regular language, then (L ) U L will be..
1.
If L is a regular language, then (L ) U L will be :
A.
L
B.
L
C.
f
D.
none of the mentioned
Answer» B. L
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
If L is a regular language, then (((L )r) )* is:
If L is a regular language, then (L ) U L will be :
Suppose a language L1 has 2 states and L2 has 2 states. After using the cross product construction method, we have a machine M that accepts L1 L2. The total number of states in M:
If A and B are regular languages, !(A U B ) is:
If L1 and L2 are regular languages, L1 (L2 U L1 ) will be
If L1 and L2 are regular languages, then L1.L2 will be
If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said to be ____________ under an operation op.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply