Semi-commutations

We extend the notion of partial commutation by introducing that of semi-commutation which is its non-symetrical version. A semi-commutation function f is associated to a semi-Thue system 〈X, P〉 where the rules are of the form yx → xy with x, y ϵ X. We study this operation in connection with rational operations. We prove that if f(R) and f(R′) are regular languages then f(RR′) is a regular language and we give a sufficient condition which ensures that f(R∗) is a regular language.

Authors

• M. Clerbout
• M. Latteux

Keywords

No keywords are indexed for this paper.