CSE 555 Theory of Computation - Organic Origami
CSE 555 Theory of Computation - Organic Origami
CSE 555 Theory of Computation - Organic Origami
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Acceptance by FA<br />
A string u over Σ is accepted by a FA M, if after M reads u,<br />
starting from q 0 , M ends up in an accepting state.<br />
The set L(M) <strong>of</strong> all strings accepted by M is called the language<br />
<strong>of</strong> the machine M. (We also say that M accepts or recognizes<br />
L(M).)
Change language