A generalized Ufnarovski graph

Jonas Månsson; Patrik Nordbeck

doi:10.1007/s00200-005-0178-8

A generalized Ufnarovski graph

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	293-306
Journal	Applicable Algebra in Engineering, Communication and Computing
Volume	16
Issue number	5
DOIs	https://doi.org/10.1007/s00200-005-0178-8
Publication status	Published - 2005

Subject classification (UKÄ)

Mathematics

Keywords

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

Access to Document

10.1007/s00200-005-0178-8

Cite this

@article{07cbc8251d7f44f4b6d071bb8d2c7173,

title = "A generalized Ufnarovski graph",

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.",

keywords = "graph, Ufnarovski, automata, non-commutative algebras, automaton algebras, Dickson's lemma, noetherianity",

author = "Jonas M{\aa}nsson and Patrik Nordbeck",

year = "2005",

doi = "10.1007/s00200-005-0178-8",

language = "English",

volume = "16",

pages = "293--306",

journal = "Applicable Algebra in Engineering, Communications and Computing",

issn = "1432-0622",

publisher = "Springer",

number = "5",

}

TY - JOUR

T1 - A generalized Ufnarovski graph

AU - Månsson, Jonas

AU - Nordbeck, Patrik

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - graph

KW - Ufnarovski

KW - automata

KW - non-commutative algebras

KW - automaton algebras

KW - Dickson's lemma

KW - noetherianity

U2 - 10.1007/s00200-005-0178-8

DO - 10.1007/s00200-005-0178-8

M3 - Article

VL - 16

SP - 293

EP - 306

JO - Applicable Algebra in Engineering, Communications and Computing

JF - Applicable Algebra in Engineering, Communications and Computing

SN - 1432-0622

IS - 5

ER -

A generalized Ufnarovski graph

Abstract

Subject classification (UKÄ)

Keywords

Access to Document

Fingerprint

Cite this