| Title | Regular Grobner bases |
| Authors | Jonas Månsson, Patrik Nordbeck |
| Alternative Location | http://dx.doi.org/10.1006/j... |
| Publication | JOURNAL OF SYMBOLIC COMPUTATION |
| Year | 2002 |
| Volume | 33 |
| Issue | 2 |
| Pages | 163 - 181 |
| Document type | Article |
| Status | Published |
| Quality controlled | Yes |
| Language | eng |
| Publisher | ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD |
| Abstract 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. |
| ISBN/ISSN/Other | ISSN: 0747-7171 |
Questions: webmaster
Last update: 2013-04-11
Centre for Mathematical Sciences, Box 118, SE-22100, Lund. Telefon: +46 46-222 00 00 (vx)