Define the language recognised by automaton $M$, written $L(M)$, as the set of all strings accepted by $M$.
Define the language denoted by regular expression R, written \(L(R)\), as the set of all strings that are matched by \(R\).
Define the language recognised by automaton $M$, written $L(M)$, as the set of all strings accepted by $M$.
Define the language denoted by regular expression R, written \(L(R)\), as the set of all strings that are matched by \(R\).