Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic

DOI10.1007/978-3-642-28332-1_34zbMath1351.20019arXiv1108.2759OpenAlexW156501607MaRDI QIDQ2890212

Zoran Šunić, Alexei G. Myasnikov

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.2759

zbMATH Keywords

isomorphism problemconjugacy problemautomatic structureCayley graph automatic groupCayley graph biautomatic group

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

Finitely Generated Semiautomatic Groups ⋮ \(\mathcal C\)-graph automatic groups. ⋮ Semiautomatic structures ⋮ Isomorphisms of scattered automatic linear orders ⋮ SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA ⋮ An example of an automatic graph of intermediate growth