An important tool for studying standard finitely presented algebras is the Ufnarovski graph. In this paper we extend the use of the Ufnarovski graph to automaton algebras, introducing the generalized Ufnarovski graph. As an application, we show how this construction can be used to test Noetherianity of automaton algebras.
|Journal||Applicable Algebra in Engineering, Communication and Computing|
|Publication status||Published - 2005|
Subject classification (UKÄ)
- non-commutative algebras
- automaton algebras
- Dickson's lemma