On Syntactic Monoids

概要

論文の詳細を見る
In this paper we consider a set of congruent classes of X^* under an equivarent relation ～. The set is called a syntactic monoid with respect to a language L. For a language L which has not type of elements in a^*b^ka^*, we give formulas about their congruent classes which means an extention of our former paper published at 1996. Furthermore we give a note about hypercodes for their maximality and quasimaximality. These consideration are essentially due to G.Thierrin 1981.
福井工業高等専門学校の論文
2003-11-25