A generalized Ufnarovski graph

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Pages (from-to)293-306
JournalApplicable Algebra in Engineering, Communication and Computing
Issue number5
Publication statusPublished - 2005

Subject classification (UKÄ)

  • Mathematics

Free keywords

  • graph
  • Ufnarovski
  • automata
  • non-commutative algebras
  • automaton algebras
  • Dickson's lemma
  • noetherianity


Dive into the research topics of 'A generalized Ufnarovski graph'. Together they form a unique fingerprint.

Cite this