همه کارتها
DFAs for a Forbidden Substring (Trap States)
Recognize "strings that avoid a fixed pattern" with a DFA that tracks the longest matched prefix of the pattern and drops into an absorbing non-accepting trap state the instant the whole pattern appears.
کارت مفهوم کنکور ارشد علوم کامپیوتر