The order of a language is defined as the smallest such that L k = L k+1.Consider the language L1 (over alphabet 0) accepted by the following automaton: The ...
確定! 回上一頁