automata regular-language. Can someone give me an idea how to prove this: suffix(L) = {y | xy ∈ L for some x ∈ Σ *}. Or suffix is the set of all suffixes ...
確定! 回上一頁