ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Journal of Symbolic Computation
Volume 33, Issue 2, February 2002, Pages 163-181
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (365 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1006/jsco.2001.0500    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Elsevier Science Ltd. All rights reserved.

Regular Articles

Regular Gröbner Bases

Jonas MÅnsson1 and Patrik Nordbeck1

Lund University, Centre for Mathematical Sciences, Box 118, SE-221 00 Lund, Sweden

Received 26 March 2001; 
accepted 25 August 2001. ;
Available online 27 February 2002.

Purchase the full-text article



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.


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.