Q. Which of the following is true with respect to Kleene’s theorem?1 A regular language is accepted by a finite automaton.2 Every language is accepted by a finite automaton or a turingmachine. (Solved)
1. 1 only
2. 2 only
3. Both 1 and 2 are true statements
4. None is true
- c. Both 1 and 2 are true statements