Séminaire Lotharingien de Combinatoire, B15l (1986), 10 pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1987, 340/S-15, p.
67-76.]
Roman König
Untermonomide freier Monoide und eine Veerallgemeinerung des
Euklidischen Algorithmus
Abstract.
Let A be a finite set (of letters), and let A*
be the free monoid over A. We ahow how to test whether a
rational subset X of a submonoid of A*
is a basis of the submonoidd, that is, a minimal generating set.
The following version is available: