(1) Centre for Mathematical Sciences, Lund University, Box 118, 221 00 Lund, Sweden
Abstract:
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.