Question: A language is regular if and only if it is accepted by finite automata.
Options
A : The given statement statement is true
B : Given statement is false
C : Statement is partially true
D : None of the mentioned
Click to view Correct Answer
Compilers Mcqs more questions
Which among the following is not a rule for writing....
Which of the following doesn’t agree with the chromosomal theory....
In Drosophila males there is complete linkage. What is the....
Which of the given statements is incorrect about Horizontal Gene....
A graph is found to be 2 colorable. What can....
Which of the following is untrue about Ab Initio–Based Programs....
Which of the following is untrue regarding EST Index Construction?
The flux limiter is a function of __________
An image has significant edge details. Which of the following....
The context free grammar is ambiguous if ______________