Finitely generated semiautomatic groups

DOI10.3233/COM-180089zbMath1396.20031OpenAlexW2797206341MaRDI QIDQ4683155

Bakhadyr Khoussainov, Sanjay Jain, Frank Stephan

Publication date: 20 September 2018

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-180089

zbMATH Keywords

semigroupsfinitely generated groupsnilpotent groupsautomatic groupsautomatic structuresCayley automatic groupssemiautomatic structures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Undecidability and degrees of sets of sentences (03D35) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (3)

Lamplighter groups and automata ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Cayley polynomial-time computable groups

This page was built for publication: Finitely generated semiautomatic groups