Home »
MCQs »
Theory of Computation MCQs
The language accepted by finite automata can be easily described by simple expressions called ____
30. The language accepted by finite automata can be easily described by simple expressions called ____.
- Constant expression
- Frequent expression
- Regular expression
- Conventional expression
Answer: C) Regular expression
Explanation:
The language accepted by finite automata can be easily described by simple expressions called Regular Expressions.