Finitely generated semiautomatic groups

DOI10.1007/978-3-319-40189-8_29MaRDI QIDQ3188266zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan

Publication date 17 August 2016

Published in Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-40189-8_29

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Nilpotent groups (20F18)

Recommendations

• Finitely generated semiautomatic groups
• From automatic structures to automatic groups.
• Automatic semigroups
• Self-automaton semigroups.
• Automaticity and commutative semigroups

Cites work

• scientific article; zbMATH DE number 3841819 (Why is no real title available?)
• Automatic functions, linear time and learning
• Cayley graph automatic groups are not necessarily Cayley graph biautomatic
• Describing Groups
• FA-presentable groups and rings
• From automatic structures to automatic groups.
• On automatic transitive graphs
• Semiautomatic structures
• The conjugacy problem in automaton groups is not solvable.

Cited in

(7)

• A Characterization of Those Automata That Structurally Generate Finite Groups
• Nonstandard Cayley automatic representations for fundamental groups of torus bundles over the circle
• Finitely generated semiautomatic groups
• Measuring closeness between Cayley automatic groups and automatic groups
• scientific article; zbMATH DE number 850246 (Why is no real title available?)
• Word automatic groups of nilpotency class 2
• Semiautomatic structures

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 Q3188266)