As an evidence of the power of finite unary substitutions we show that the inclusion problem for finite substitutions on the language L = ab*c is undecidable, i.e. it is undecidable whether for two finite substitutions Φ and ψ the relation Φ(w) is contained in ψ(w) holds for all w in L.
展开▼
机译：作为有限机构的能力的证据，我们表明，对于语言L = AB * C的有限取代的夹杂物问题是不可判定的，即对于两个有限取代φ和ψ含有φ（w）是不可识别的。在ψ（w）持有L.的所有W.
展开▼
