Theory of Computation (Automata)
Which statement correctly explains Regular language?
- A. A visual representation showing how an automaton moves between states based on input symbols.
- B. An automaton that uses a stack to recognize context-free languages.
- C. A sequence of characters that defines a search pattern, corresponding to regular languages.
- D. A language that can be expressed using a regular expression or recognized by a finite automaton. ✓
Correct answer
D. A language that can be expressed using a regular expression or recognized by a finite automaton.
Explanation
Regular language refers to a language that can be expressed using a regular expression or recognized by a finite automaton.