A Class by Principal Congruence of a Syntactically Embedded Language(Automata and Formal Language Theory)

概要

論文の詳細を見る
In this paper, we introduce a syntactically embedded (s-embedded) language, and consider its principal congruence. The following three results are proved, where P_L is the principal congruence of a language L, and W(L) is the residual of L. (1) For a language K, s-embedded in M, K is equal to a P_M class. (2) For a language K, s-embedded in an infix language M, K is equal to a P_<W(M)> class. (3) For a nonempty s-embedded language L, if L is double-unitary, then L is equal to a P_<W(M)> class. From the above results, we can obtain those for principal congruence of some codes. For example, L^n is equal to a P_<L^<n+1>> class for an inter code L of index n.
社団法人電子情報通信学会の論文
2007-06-01