To prove tightness, we use a ternary alphabet, and we show that this bound cannot be met by any binary prefix-free language. On non-returning languages, ...
確定! 回上一頁