14.07.2013 Views

r - 南京大学计算机科学与技术系

r - 南京大学计算机科学与技术系

r - 南京大学计算机科学与技术系

SHOW MORE
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.

有穷⾃自动机<br />

Lex的核心<br />

本质上等价与状态转换图<br />

区别在于:<br />

自动机是识别器,对每个输入串回答yes or no<br />

分为两类<br />

不确定的有穷自动机(Nondeterministic Finite<br />

Automate,NFA)<br />

确定的有穷状态自动机(Deterministic Finite Automate,<br />

DFA)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!