Metraipolis › archive › dc_e577e6cc946a

Automatic group — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Automatic_group
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-10T12:00:57.984Z
SHA-256 of the archived text
c9453a5c95c250c354382060095ffb282e86d73a80b989c1c33a02b48c6618a8
Stable URL of this page
https://metraipolis.com/documento/dc_e577e6cc946a

How to cite

Automatic group — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Automatic_group (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_e577e6cc946a (Metraipolis archive dc_e577e6cc946a, sha256 c9453a5c95c250c354382060095ffb282e86d73a80b989c1c33a02b48c6618a8)
BibTeX
@misc{dce577e6cc946a,
  title = {Automatic group — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Automatic_group},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_e577e6cc946a; sha256 c9453a5c95c250c354382060095ffb282e86d73a80b989c1c33a02b48c6618a8},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Automatic_group. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, an automatic group is a finitely generated group equipped with several finite-state automata. These automata represent the Cayley graph of the group. That is, they can tell whether a given word representation of a group element is in a "canonical form" and can tell whether two elements given in canonical words differ by a generator. More precisely, let G be a group and A be a finite set of generators. Then an automatic structure of G with respect to A is a set of finite-state automata: the word-acceptor, which accepts for every element of G at least one word in A∗ representing it; multipliers, one for each a∈A∪{1}, which accept a pair (w1, w2), for words wi accepted by the word-acceptor, precisely when w1a=w2 in G. The property of being automatic does not depend on the set of generators.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Automatic group» — https://en.wikipedia.org/wiki/Automatic_group
Wikidata Q4826571 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4826571
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Automatic_group?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1383367902, consultata il 2026-11-10T11:56:28.727Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 573238e7af077b95f3eabdc4f2c73c496a2c41eeecccac9783b4b4b0e8634739