Mathematics – Logic
Scientific paper
2012-03-01
Mathematics
Logic
Scientific paper
The square-free word problem relative to a system of two defining relations
is decidable.
No associations
LandOfFree
On algorithmic decidability of the square-free word problem relative to a system of two defining relations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On algorithmic decidability of the square-free word problem relative to a system of two defining relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On algorithmic decidability of the square-free word problem relative to a system of two defining relations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-165604