Cayley linear-time computable groups

DOI10.46298/JGCC.2024.15.2.12503MaRDI QIDQ6601468FDOQ6601468

Authors: Prohrak Kruengthomya, D. A. Berdinskij 

Publication date: 10 September 2024

Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)

Recommendations

• Cayley polynomial-time computable groups
• From automatic structures to automatic groups.
• On groups that have normal forms computable in logspace.
• \(\mathcal C\)-graph automatic groups.
• Polynomial-time word problems.

zbMATH Keywords

Thompson's groupmulti-tape Turing machinewreath productCayley linear-time computable group

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)

Cites Work

• Title not available (Why is that?)
• Introductory notes on Richard Thompson's groups
• Title not available (Why is that?)
• From automatic structures to automatic groups.
• Thompson's group \(F\) is 1-counter graph automatic.
• \(\mathcal C\)-graph automatic groups.
• An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group
• Parallel poly-pushdown groups
• Formal language theory and the geometry of 3-manifolds
• Algorithms and topology of Cayley graphs for groups.
• Lamplighter groups and automata
• Automatic functions, linear time and learning
• Cayley polynomial-time computable groups
• Cayley automatic representations of wreath products
• Finitely generated semiautomatic groups

Cited In (1)

• Extending the synchronous fellow traveler property

This page was built for publication: Cayley linear-time computable groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601468)