Back to Search
Start Over
Recognition of certain properties of automaton algebras.
- Source :
-
Journal of Mathematical Sciences . Jul2008, Vol. 152 Issue 1, p95-136. 42p. - Publication Year :
- 2008
-
Abstract
- Abstract. The paper considers a new algebraic object, the completely automaton binomial algebras, which generalize certain existing classes of algebras. The author presents a classification of semigroup algebras taking into account completely automaton algebras and gives the corresponding examples. A number of standard algorithmic problems are solved for completely automaton binomial algebras: the recognition of a strict and nonstrict polynomial property, the recognition of the right and/or left finite processing, and the construction of the determining regular language for an algebra with finite processing and for monomial subalgebras of a free associative algebra and certain completely automaton algebras. For an automaton monomial algebra, the author constructs the left syzygy module of a finite system of elements and the Gröbner basis of a finitely generated left ideal; also, some algorithmic problems are solved. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10723374
- Volume :
- 152
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Journal of Mathematical Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 33937183
- Full Text :
- https://doi.org/10.1007/s10958-008-9048-9