Results 1 
2 of
2
Simple equations on binary factorial languages
, 2008
"... We consider equations on the monoid of factorial languages on the binary alphabet. We use the notion of a canonical decomposition of a factorial language and previous results by Avgustinovich and the author to solve several simple equations on binary factorial languages including X n = Y n, the comm ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider equations on the monoid of factorial languages on the binary alphabet. We use the notion of a canonical decomposition of a factorial language and previous results by Avgustinovich and the author to solve several simple equations on binary factorial languages including X n = Y n, the commutation equation XY = Y X and the conjugacy equation XZ = ZY. At the end of the paper we discuss the difficulties hindering to reduce equations on factorial languages to equations on words and to enlarge the alphabet considered.
Canonical decomposition of a catenation of factorial languages
 Siberian Electronic Mathematical Reports 4 (2007) 14–22
"... Abstract. According to a previous result by S. V. Avgustinovich and the author, each factorial language admits a unique canonical decomposition to a catenation of factorial languages. In this paper, we analyze the appearance of the canonical decomposition of a catenation of two factorial languages w ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. According to a previous result by S. V. Avgustinovich and the author, each factorial language admits a unique canonical decomposition to a catenation of factorial languages. In this paper, we analyze the appearance of the canonical decomposition of a catenation of two factorial languages whose canonical decompositions are given. 1.