首页> 外文会议>Language and automata theory and applications. >Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic
【24h】

Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic

机译:Cayley图自动组不是必需的Cayley图Biautomatic

获取原文
获取原文并翻译 | 示例

摘要

We show that there are Cayley graph automatic groups that are not Cayley graph biautomatic. In addition, we show that there are Cayley graph automatic groups with undecidable Conjugacy Problem and that the Isomorphism Problem is undecidable in the class of Cayley graph automatic groups.
机译:我们表明,有不是非自动Cayley图的Cayley图自动组。此外,我们表明存在具有不确定共轭问题的Cayley图自动组,并且在Cayley图自动组的类别中同构问题是不确定的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号