KonkurStudy
همه کارت‌ها

Counting strings accepted by a DFA via complement (trap state)

When almost all states accept, count total strings and subtract those that fall into the trap state.

کارت مفهوم کنکور ارشد علوم کامپیوتر