A finite automata recognizes ____________ A. Any Language B.

a-finite-automata-recognizes-a-any-language-b

A finite automata recognizes ____________

A. Any Language

B. Context Sensitive Language

C. Context Free Language

D. Regular Language

This question was posed to me in an internship interview.

My doubt is from Finite Automata in division Finite Automata and Regular Expression of Compiler

Correct option is D. Regular Language

Best explanation: All regular languages are implemented by finite automata.