Automatic semigroup
id:
automatic-semigroup-196-18067084
title:
Automatic semigroup
text:
In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a generating set. One of these languages determines "canonical forms" for the elements of the semigroup, the other languages determine if two canonical forms represent elements that differ by multiplication by a generator. Formally, let S be a semigroup and A be a finite set of generators. Then an automatic structure for S with respect to A consists of a
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical structure
original url:
https://en.wikipedia.org/wiki/Automatic_semigroup
date created:
date modified:
2024-01-18T21:27:19Z
main entity:
{"identifier":"Q4826597","url":"https://www.wikidata.org/entity/Q4826597"}
image:
fields total:
13
integrity:
14