Cayley polynomial-time computable groups
From MaRDI portal
Publication:2084772
DOI10.1016/J.IC.2021.104768OpenAlexW3046981564MaRDI QIDQ2084772FDOQ2084772
Authors: D. A. Berdinskij, Murray Elder, Prohrak Kruengthomya 
Publication date: 13 October 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.02511
Cayley distance functionCayley polynomial-time computable groupCayley position-faithful linear-time computable groupposition-faithful one-tape Turing machine
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite automata presentable Abelian groups
- From automatic structures to automatic groups.
- Thompson's group \(F\) is 1-counter graph automatic.
- On Automatic Transitive Graphs
- \(\mathcal C\)-graph automatic groups.
- Metric properties of Baumslag–Solitar groups
- Parallel poly-pushdown groups
- Formal language theory and the geometry of 3-manifolds
- Algorithms and topology of Cayley graphs for groups.
- Multi-stack-counter languages
- Title not available (Why is that?)
- On a problem of Philip Hall
- Measuring closeness between Cayley automatic groups and automatic groups
- Automatic functions, linear time and learning
- Higher rank lamplighter groups are graph automatic
- Cayley automatic representations of wreath products
- Finitely generated semiautomatic groups
- BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS
- On the geometry of Cayley automatic groups
- Towards quantitative classification of Cayley automatic groups
Cited In (5)
This page was built for publication: Cayley polynomial-time computable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084772)
