#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

A regular expression consisting of a finite set of grammar rules is a quadruple.

Answer

FALSE