A generalized Ufnarovski graph
Författare
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.
Avdelning/ar
- Matematik LTH
- Algebra
Publiceringsår
2005
Språk
Engelska
Sidor
293-306
Publikation/Tidskrift/Serie
Applicable Algebra in Engineering, Communication and Computing
Volym
16
Issue
5
Dokumenttyp
Artikel i tidskrift
Förlag
Springer
Ämne
- Mathematics
Nyckelord
- graph
- Ufnarovski
- automata
- non-commutative algebras
- automaton algebras
- Dickson's lemma
- noetherianity
Status
Published
Forskningsgrupp
- Algebra
ISBN/ISSN/Övrigt
- ISSN: 1432-0622