论文信息 - A generalized Ufnarovski graph

A generalized Ufnarovski graph

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.

Patrik Nordbeck | Jonas Månsson | J. Månsson | P. Nordbeck

[1] Teo Mora,et al. An Introduction to Commutative and Noncommutative Gröbner Bases , 1994, Theor. Comput. Sci..

[2] Patrik Nordbeck,et al. On the Finiteness of Gröbner Bases Computation in Quotients of the Free Algebra , 2001, Applicable Algebra in Engineering, Communication and Computing.

[3] P. Nordbeck. Canonical Bases for Algebraic Computations , 2001 .

[4] V. V. Borisenko,et al. Monomial algebras , 1997 .

[5] L. Dickson. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[6] Jonas Månsson. Formal Languages and Automata in Computational Algebra , 2002 .

[7] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[8] V. A. Ufnarovskij. Combinatorial and Asymptotic Methods in Algebra , 1995 .