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
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u2...
AbstractIn 1965, Buchberger introduced the notion of Gröbner bases for a polynomial ideal and an alg...
The theory of Grobner bases has garnered the interests of a large number of researchers in computati...
AbstractIn this paper we introduce the concept of bi-automaton algebras, generalizing the automaton ...
AbstractIn this paper we introduce the concept of bi-automaton algebras, generalizing the automaton ...
This thesis is a collection of six papers in computational algebra. In particular, we study noncommu...
This thesis deals with computational methods in algebra, mainly focusing on the concept of Gröbner a...
To Joseph Goguen on the occasion of his 65th birthday1. Abstract. This papers reviews the classical ...
We consider in this paper the basis finite automaton and its some properties. We shall also consider...
This paper presents a taxonomy of finite automata construction algorithms. Each algorithm is classif...
This paper presents a taxonomy of finite automata construction algorithms. Each algorithm is classif...
AbstractA bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the...
Abstract. In this paper we consider non-deterministic finite Rabin–Scott’s automata. We obtain some ...
We derive a sufficient condition for a generating set of an ideal in the free (non-associative, non-...
Bisemigroups are algebras equipped with two independent associative op-erations. Labeled nite sp-bip...
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u2...
AbstractIn 1965, Buchberger introduced the notion of Gröbner bases for a polynomial ideal and an alg...
The theory of Grobner bases has garnered the interests of a large number of researchers in computati...
AbstractIn this paper we introduce the concept of bi-automaton algebras, generalizing the automaton ...
AbstractIn this paper we introduce the concept of bi-automaton algebras, generalizing the automaton ...
This thesis is a collection of six papers in computational algebra. In particular, we study noncommu...
This thesis deals with computational methods in algebra, mainly focusing on the concept of Gröbner a...
To Joseph Goguen on the occasion of his 65th birthday1. Abstract. This papers reviews the classical ...
We consider in this paper the basis finite automaton and its some properties. We shall also consider...
This paper presents a taxonomy of finite automata construction algorithms. Each algorithm is classif...
This paper presents a taxonomy of finite automata construction algorithms. Each algorithm is classif...
AbstractA bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the...
Abstract. In this paper we consider non-deterministic finite Rabin–Scott’s automata. We obtain some ...
We derive a sufficient condition for a generating set of an ideal in the free (non-associative, non-...
Bisemigroups are algebras equipped with two independent associative op-erations. Labeled nite sp-bip...
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u2...
AbstractIn 1965, Buchberger introduced the notion of Gröbner bases for a polynomial ideal and an alg...
The theory of Grobner bases has garnered the interests of a large number of researchers in computati...
DOI
Add to ORKG