Cayley polynomial-time computable groups
From MaRDI portal
Publication:2084772
Recommendations
Cites work
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 3257446 (Why is no real title available?)
- Algorithms and topology of Cayley graphs for groups.
- Automatic functions, linear time and learning
- BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS
- Cayley automatic representations of wreath products
- Finite automata presentable Abelian groups
- Finitely generated semiautomatic groups
- Formal language theory and the geometry of 3-manifolds
- From automatic structures to automatic groups.
- Higher rank lamplighter groups are graph automatic
- Measuring closeness between Cayley automatic groups and automatic groups
- Metric properties of Baumslag-Solitar groups.
- Multi-stack-counter languages
- On a problem of Philip Hall
- On automatic transitive graphs
- On the geometry of Cayley automatic groups
- Parallel poly-pushdown groups
- Thompson's group \(F\) is 1-counter graph automatic.
- Towards quantitative classification of Cayley automatic groups
- \(\mathcal C\)-graph automatic groups.
Cited in
(5)- Cayley Polynomial-Time Computable Groups
- scientific article; zbMATH DE number 3964134 (Why is no real title available?)
- Cayley linear-time computable groups
- Special issue: Selected papers of the 14th international conference on language and automata theory and applications, LATA 2020
- scientific article; zbMATH DE number 4057755 (Why is no real title available?)
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)