 Free associative algebra

The free associative algebra has a basis of finite words in its generators, including the empty word as identity. Multiplication concatenates words without commutativity relations. It is the path algebra of the quiver with r loops. With one generator it is a polynomial algebra.