AbstractIn 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
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automat...
We solve an open question of Milner [1984].We define a set of so-called well-behaved finite automata...
We solve an open question of Milner [1984].We define a set of so-called well-behaved finite automata...
In this paper we introduce the concept of bi-automaton algebras, generalizing the automaton algebras...
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...
Abstract. In this paper we consider non-deterministic finite Rabin–Scott’s automata. We obtain some ...
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...
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automat...
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automat...
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automat...
We solve an open question of Milner [1984].We define a set of so-called well-behaved finite automata...
We solve an open question of Milner [1984].We define a set of so-called well-behaved finite automata...
In this paper we introduce the concept of bi-automaton algebras, generalizing the automaton algebras...
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...
Abstract. In this paper we consider non-deterministic finite Rabin–Scott’s automata. We obtain some ...
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...
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automat...
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automat...
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automat...
We solve an open question of Milner [1984].We define a set of so-called well-behaved finite automata...
We solve an open question of Milner [1984].We define a set of so-called well-behaved finite automata...
DOI
Add to ORKG