Copyright © 2002 Elsevier Science Ltd. All rights reserved.
Regular Articles
Regular Gröbner Bases
Received 26 March 2001;
accepted 25 August 2001. ;
Available online 27 February 2002.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper we introduce the concept of bi-automaton algebras, generalizing the automaton algebras previously defined by Ufnarovski. A bi-automaton algebra is a quotient of the free algebra, defined by a binomial ideal admitting a Gröbner basis which can be encoded as a regular set; we call such a Gröbner basis regular. We give several examples of bi-automaton algebras, and show how automata connected to regular Gröbner bases can be used to perform reduction.







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)




