Regular Grobner bases
Författare
Summary, in English
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 Grobner basis which can be encoded as a regular set; we call such a Grobner basis regular. We give several examples of bi-automaton algebras, and show how automata connected to regular Grobner bases can be used to perform reduction. (C) 2002 Academic Press.
Avdelning/ar
- Matematik LTH
- Algebra
Publiceringsår
2002
Språk
Engelska
Sidor
163-181
Publikation/Tidskrift/Serie
Journal of Symbolic Computation
Volym
33
Issue
2
Dokumenttyp
Artikel i tidskrift
Förlag
Elsevier
Ämne
- Mathematics
Status
Published
Forskningsgrupp
- Algebra
ISBN/ISSN/Övrigt
- ISSN: 0747-7171