A string $w$ is said to be accepted by a finite automaton $M$ just if there is an accepting run of $M$ on $w$.
The language recognised by $M$, written $L(M)$, is the set of all strings accepted by $M$.
A string $w$ is said to be accepted by a finite automaton $M$ just if there is an accepting run of $M$ on $w$.
The language recognised by $M$, written $L(M)$, is the set of all strings accepted by $M$.