Finitely generated semiautomatic groups

DOI10.3233/COM-180089MaRDI QIDQ4683155zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Bakhadyr Khoussainov, 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

automatic groupsautomatic structuresCayley automatic groupsfinitely generated groupsnilpotent groupssemiautomatic structuressemigroups

Mathematics Subject Classification ID

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

Recommendations

• Finitely generated semiautomatic groups
• Automatic semigroups
• From automatic structures to automatic groups.
• Automaticity and commutative semigroups
• Cayley graph automatic groups are not necessarily Cayley graph biautomatic

Cited in

(10)

• From automatic structures to automatic groups.
• Cayley polynomial-time computable groups
• Lamplighter groups and automata
• Finitely generated semiautomatic groups
• scientific article; zbMATH DE number 850246 (Why is no real title available?)
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• A Characterization of Those Automata That Structurally Generate Finite Groups
• Word automatic groups of nilpotency class 2
• Cayley linear-time computable groups
• Word structures and their automatic presentations

This page was built for publication: Finitely generated semiautomatic groups

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