Finitely Generated Semiautomatic Groups (Q3188266)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Finitely Generated Semiautomatic Groups	scientific article

Statements

scholarly article

0 references

Finitely Generated Semiautomatic Groups (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-40189-8_29

0 references

0 references

Bakhadyr Khoussainov

0 references

0 references

Pursuit of the Universal

0 references

publication date

17 August 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-40189-8_29

0 references

0 references

On Automatic Transitive Graphs

0 references

Automatic functions, linear time and learning

0 references

0 references

Semiautomatic Structures

0 references

From automatic structures to automatic groups.

0 references

Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic

0 references

Describing Groups

0 references

FA-presentable groups and rings

0 references

The conjugacy problem in automaton groups is not solvable.

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3188266

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3188266&oldid=36267878"