The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

A generalized Ufnarovski graph

På svenska

Author

Summary, in English

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.

Publishing year

2005

Language

English

Pages

293-306

Publication/Series

Applicable Algebra in Engineering, Communication and Computing

Volume

16

Issue

5

Document type

Journal article

Publisher

Springer

Topic

  • Mathematics

Keywords

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

Status

Published

Research group

  • Algebra

ISBN/ISSN/Other

  • ISSN: 1432-0622