Paper Info
Title
Towards Decidability of Conjugacy of Pairs and Triples
Abstract
The equation XZ = ZY is called the conjugacy equation. Here X , Y and Z are languages over a finite alphabet. Given two sets X and Y , we can ask "Does there exist a Z which makes the conjugacy equation true?". We answer this question partially in the case when one of them is a two element set and the other is a three element set.
Year
DOI
Venue
2009
10.1007/978-3-540-92701-3_16
ICLA
Keywords
Field
DocType
towards decidability,finite alphabet,element set,conjugacy equation,equation xz
Discrete mathematics,Conjugacy problem,Combinatorics,Conjugacy class,Decidability,Mathematics,Alphabet
Conference
Volume
ISSN
Citations 
5378
0302-9743
0
PageRank 
References 
Authors
0.34
7
2
Name
Order
Citations
PageRank
Benny George Kenkireth100.68
Samrith Ram2203.52