On Automatic Transitive Graphs

DOI10.1007/978-3-319-09698-8_1zbMath1344.68115arXiv1511.01630OpenAlexW334956220MaRDI QIDQ2921970

Bakhadyr Khoussainov, Dmitry Berdinsky

Publication date: 14 October 2014

Published in: Developments in Language Theory (Search for Journal in Brave)

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

zbMATH Keywords

finite automatatransitive graphsautomatic graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extensions, wreath products, and other compositions of groups (20E22)

Related Items (8)

Thompson's group \(F\) is 1-counter graph automatic. ⋮ Finitely Generated Semiautomatic Groups ⋮ On the geometry of Cayley automatic groups ⋮ Higher rank lamplighter groups are graph automatic ⋮ String compression in FA-presentable structures ⋮ Cayley Automatic Groups and Numerical Characteristics of Turing Transducers ⋮ Cayley polynomial-time computable groups ⋮ BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS

This page was built for publication: On Automatic Transitive Graphs