Multiple Choice
A language is regular if and only if
A) Accepted by DFA
B) Accepted by PDA
C) Accepted by LBA
D) Accepted by Turing machine
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q38: The regular sets are closed under:<br>A)Union<br>B)Concatenation<br>C)Kleene closure<br>D)All
Q39: Given a Non-deterministic Finite Automation (NFA) with
Q40: The following grammar<br>G = (N, T, P,
Q41: Which of the following statement is wrong?<br>A)Any
Q42: Which one of the following languages over
Q44: P, Q, R are three languages. If
Q45: The following CFG is in S ?
Q46: A?abA a type _productions<br>A)Type 0<br>B)Type 1<br>C)Type 2<br>D)Type
Q47: "S ?a S", what is the type
Q48: Which of the statements is true:<br>A)The complement