Limbaje Formale, Automate şi Compilatoare
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Automatul determinist minimal<br />
Algoritm pentru determinarea relaţiei ρ<br />
// qi si qj devin separabile si la fel toate<br />
// perechile de stari dependente de qi,qj<br />
update separabil(qi, qj){<br />
separabil[qi, qj] = 1;<br />
for ((q i, ′ q j) ′ ∈ lista[qi, qj]){<br />
if (separabil[q i, ′ q j] ′ == 0)<br />
update separabil(q i, ′ q j);<br />
′<br />
}<br />
}<br />
LFAC (2014-15) Curs 3 28 / 30
Change language