Theory of Computation (Automata)
A sequence of characters that defines a search pattern, corresponding to regular languages. What is this concept called?
- A. Non-deterministic finite automaton (NFA)
- B. Chomsky hierarchy
- C. Finite automaton
- D. Regular expression ✓
Correct answer
D. Regular expression
Explanation
Regular expression refers to a sequence of characters that defines a search pattern, corresponding to regular languages.