The regular language L = b(a3)∗ +cba∗ + da(a3)∗ is a non-reflexive splicing ... Otherwise, given words b(a3)i−1 ∈ L(S), for i > 1 and word da(a3)i ...
確定! 回上一頁