Journal of Symbolic Computation
A completion procedure for computing canonical basis for a k-Subalgebra
Proceedings of the third conference on Computers and mathematics
The use of Knuth-Bendix methods to solve the wordproblem in automatic groups
Journal of Symbolic Computation - Special issue on computational group theory: part 2
An introduction to commutative and noncommutative Gro¨bner bases
Selected papers of the second international colloquium on Words, languages and combinatorics
Text algorithms
Term rewriting and all that
Canonical subalgebraic bases in non-commutative polynomial rings
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Theoretical Computer Science - Special issue on rewriting techniques and applications
Some undecidability results concerning the property of preserving regularity
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
Semigroups and Combinatorial Applications
Semigroups and Combinatorial Applications
Automata, Languages, and Machines
Automata, Languages, and Machines
Word Processing in Groups
Inductive Inference for Solving Divergence in Knuth-Bendix Completion
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
| Hi-index | 0.00 |
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 Grbner basis which can be encoded as a regular set; we call such a Grbner basis regular. We give several examples of bi-automaton algebras, and show how automata connected to regular Grbner bases can be used to perform reduction. Copyright 2002 Academic Press