A note on intersections of free submonoids of a free monoid
暂无分享,去创建一个
According to a theorem of Tilson [6] any intersection of free submonoids of a free monoid is free. Here we consider intersections of the form {x, y}* ∩ {u, v}*, where x, y, u and v are words in a finitely generated free monoid Σ*, and show that if both the monoids {x, y}* and {u, v}* are of the rank two, then the intersection is a free monoid generated either by (at most) two words or by a regular language of the form β0 + β((γ(1+ δ + ... δt))*ε for some words β0, β, γ, δ and ε, and some integer t≥0. An example is given showing that the latter possibility may occur for each t≥0 with nonempty values of the words.
[1] J. Berstel,et al. Sur le théorème du défaut , 1979 .
[2] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .
[3] Tom Head,et al. Automata That Recognize Intersections of Free Submonoids , 1977, Inf. Control..
[4] Bret Tilson. The intersection of free submonoids of a free monoid is free , 1972 .
[5] Andrzej Ehrenfeucht,et al. On binary equality sets and a solution to the test set conjecture in the binary case , 1983 .