The Gateway to Computer Science Excellence
+1 vote
31 views
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.$
in Theory of Computation by Boss (17.5k points)
retagged by | 31 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,397 answers
198,610 comments
105,452 users