text: For a finite group G, it is possible to build a presentation of G from the group multiplication table, as follows. Take S to be the set elements  of G and R to be all words of the form , where  is an entry in the multiplication table.
  Alternate definition
  The definition of group presentation may alternatively be recast in terms of equivalence classes of words on the alphabet .  In this perspective, we declare two words to be equivalent if it is possible to get from one to the other by a sequence of moves, where each move consists of adding or removing a consecutive pair  or  for some  in , or by adding or removing a consecutive copy of a relator.  The group elements are the equivalence classes, and the group operation is concatenation.
  This point of view is particularly common in the field of combinatorial group theory.
  Finitely presented groups
  A presentation is said to be finitely generated if S is finite and finitely related if R is finite. If both are finite it is said to be a finite presentation. A group is finitely generated (respectively finitely related, ) if it has a presentation that is finitely generated (respectively finitely related, a finite presentation). A group which has a finite presentation with a single relation is called a one-relator group.