A generalized Ufnarovski graph
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.
ufnarovski graph automaton algebras noetherianity non-commutative algebras automata dickson's lemma