Načítá se...
ON A GENERALIZATION OF DEHN’S ALGORITHM
Viewing Dehn’s algorithm as a rewriting system, we generalize to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to include finitely generated nilpotent groups, many relatively hy...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2008
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2791467/ https://ncbi.nlm.nih.gov/pubmed/20011460 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1142/S0218196708004822 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|