DM
2000
13 years 11 months ago
2000
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
IPL
2008
13 years 11 months ago
2008
: We investigate weighted automata with discounting and their behaviours over semirings and finitely generated graded monoids. We characterize the discounted behaviours of weighted...
IJAC
2006
13 years 11 months ago
2006
There is a well-known correspondence between varieties of algebras and fully invariant congruences on the appropriate term algebra. A special class of varieties are those which ar...
IJAC
2008
13 years 11 months ago
2008
species and combinatorial Hopf algebras on the one hand, and quantum groups and the classification theory of abstract Hopf algebras on the other. This is part of joint work with Sw...
AISC
2008
Springer
14 years 1 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
FCT
1999
Springer
14 years 3 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...