例如,第二条规则,初始状态是S,S能产生aB,所以如果读入一个字符a,状态就可以从S变成B,记为S\stackrel{a}{\longrightarrow}B;同理第一条规则S\stackrel{a}{\longrightarrow}A。这样就出现了一种情况,读入字符a可以有两种状态供你选择,这种FSA记为NFA(non-deterministic finite automaton非确定性有限状态机) ...
{ - "version": "7.19.1", - "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.19.1.tgz", - "integrity": "sha512-awrNfaMtnHUr653GgGEs++LlAvW6w+DcPrOliSMXWCKo597CwL5Acf/wWdNkf/tfEQE3mjkeD1YOVZOUV/od1w==", + "version": "...