AbstractWe study prime monomial algebras. Our main result is that a prime finitely presented monomial algebra is either primitive or it has GK dimension one and satisfies a polynomial identity. More generally, we show that this result holds for the class of automaton algebras; that is, monomial algebras that have a basis consisting of the set of words recognized by some finite state automaton. This proves a special case of a conjecture of the first author and Agata Smoktunowicz
The author, who died in 1984, is well-known both as a person and through his research in mathematica...
Let T_Sigma be the set of ground terms over a finite ranked alphabet Sigma. We define partial aut...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
We study prime monomial algebras. Our main result is that a prime finitely presented monomial algebr...
Eilenberg has shown that the notion of varieties in semigroups/monoids can be naturally made to cor...
AbstractThe structure of a finitely presented monomial algebra K[X]/K[I] over a field K is described...
We show that some results from the theory of group automata and monoid automata still hold for more...
This thesis is a collection of six papers in computational algebra. In particular, we study noncommu...
AbstractGiven a finite alphabet X and an ordering ≺ on the letters, the map σ≺ sends each monomial o...
On one hand, the Eilenberg variety theorem establishes a bijective correspondence between varieties ...
AbstractWe consider the first-order theory of the free infinitely generated monoid with the usual pr...
We study languages over infinite alphabets equipped with some structure thatcan be tested by recogni...
We consider an algebra with non-standard operations on the class of row monomial matrices (having on...
The paper considers computer algebra in a non-commutative setting. So far, suchinvestigations have b...
AbstractWe consider the notion of rationality in algebras with a designated binary associative opera...
The author, who died in 1984, is well-known both as a person and through his research in mathematica...
Let T_Sigma be the set of ground terms over a finite ranked alphabet Sigma. We define partial aut...
There is a strong connection between monoids, automata and languages. The traditional approach is to...
We study prime monomial algebras. Our main result is that a prime finitely presented monomial algebr...
Eilenberg has shown that the notion of varieties in semigroups/monoids can be naturally made to cor...
AbstractThe structure of a finitely presented monomial algebra K[X]/K[I] over a field K is described...
We show that some results from the theory of group automata and monoid automata still hold for more...
This thesis is a collection of six papers in computational algebra. In particular, we study noncommu...
AbstractGiven a finite alphabet X and an ordering ≺ on the letters, the map σ≺ sends each monomial o...
On one hand, the Eilenberg variety theorem establishes a bijective correspondence between varieties ...
AbstractWe consider the first-order theory of the free infinitely generated monoid with the usual pr...
We study languages over infinite alphabets equipped with some structure thatcan be tested by recogni...
We consider an algebra with non-standard operations on the class of row monomial matrices (having on...
The paper considers computer algebra in a non-commutative setting. So far, suchinvestigations have b...
AbstractWe consider the notion of rationality in algebras with a designated binary associative opera...
The author, who died in 1984, is well-known both as a person and through his research in mathematica...
Let T_Sigma be the set of ground terms over a finite ranked alphabet Sigma. We define partial aut...
There is a strong connection between monoids, automata and languages. The traditional approach is to...