Theory of Computation (Automata)
Choose the correct description of Regular expression.
- A. A finite automaton that may have multiple possible transitions for a given state and input symbol.
- B. A language that can be expressed using a regular expression or recognized by a finite automaton.
- C. A sequence of characters that defines a search pattern, corresponding to regular languages. ✓
- D. An abstract machine with a finite number of states used to recognize patterns in input strings.
Correct answer
C. A sequence of characters that defines a search pattern, corresponding to regular languages.
Explanation
Regular expression refers to a sequence of characters that defines a search pattern, corresponding to regular languages.