Is the following statement correct?

Statement: Thompson construction is used to convert Regular expression to finite automata.

Explore topic-wise MCQs in Automata Theory Questions and Answers.

This section includes 1 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.

1.	Is the following statement correct?
A.	Statement: Thompson construction is used to convert Regular expression to finite automata.
B.	Yes
C.	No
Answer» B. Yes

Discussion