retagged by
369 views
1 votes
1 votes
Let us assume a binary alphabet $\Sigma=\{a,b\}.$ Two words $u,v\in \Sigma^{\ast}$ are said to be conjugates if there exist $w_{1},w_{2}\in \Sigma^{\ast}$ such that $u=w_{1}w_{2}$ and  $v=w_{2}w_{1}.$ Prove that $u$ and $v$ are conjugates if and only if there exists  $w\in \Sigma^{\ast}$ such that $uw=wv.$
retagged by

1 Answer

Related questions

0 votes
0 votes
2 answers
3
gatecse asked Sep 13, 2019
733 views
Consider the assertion: Any connected undirected graph $G$ with at least two vertices contains a vertex $v$ such that deleting $v$ from $G$ results in a connected graph....