FUNDAMENTALNAYA
I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2002, VOLUME 8, NUMBER 2, PAGES 503-516

**On the recognition of the finite definiteness of an automation
monomial algebra**

D. A. Matsnev

Abstract

View as HTML
View as gif image
View as LaTeX source

In this paper an algorithm for recognition of finite definiteness of
an automaton monomial algebra is proposed.
It is shown that this problem for an arbitrary algebra reduces to the
following problems: determination of the star height of a regular
language and finite definiteness recognition for a certain class
of automaton algebras.
The solution of the former problem has already been described in the
literature, the complete solution of the latter problem is presented
in this paper.

All articles are
published in Russian.

Location: http://mech.math.msu.su/~fpm/eng/k02/k022/k02208h.htm

Last modified: November 26, 2002