Cayley graph automatic groups are not necessarily Cayley graph biautomatic

Alexei Miasnikov, Zoran Šunić

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications - 6th International Conference, LATA 2012, Proceedings
Pages401-407
Number of pages7
DOIs
StatePublished - 2012
Event6th International Conference on Language and Automata Theory and Applications, LATA 2012 - A Coruna, Spain
Duration: 5 Mar 20129 Mar 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7183 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Language and Automata Theory and Applications, LATA 2012
Country/TerritorySpain
CityA Coruna
Period5/03/129/03/12

Keywords

  • Automatic Structure
  • Cayley Graph Automatic Group
  • Cayley Graph Biautomatic Group
  • Conjugacy Problem
  • Isomorphism Problem

Fingerprint

Dive into the research topics of 'Cayley graph automatic groups are not necessarily Cayley graph biautomatic'. Together they form a unique fingerprint.

Cite this