Beginner
Theory of Computation
Q2 / 100
What is a regular language?
Correct! Well done.
Incorrect.
The correct answer is B) A language recognized by a finite automaton or described by a regular expression
B
Correct Answer
A language recognized by a finite automaton or described by a regular expression
Explanation
Regular languages are the simplest class in the Chomsky hierarchy. They are closed under union, concatenation, and Kleene star, and can be represented by DFA, NFA, or regex.
Progress
2/100