300 search results - page 3 / 60 » Syntactic Monoids in a Category |
DLT
2003
13 years 8 months ago
2003
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...
ACTA
2007
13 years 7 months ago
2007
The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
We show that the category FinVectk of finite dimensional vector spaces and linear maps over any field k is (collectively) complete for the traced symmetric monoidal category freely...
TAPSOFT
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. We introduce the notion of strongly concatenable process as a refinement of concatenable processes [3] which can be expressed axiomatically via a functor Q[ ] from the c...
PPDP
2000
Springer
13 years 11 months ago
2000
Springer
We introduce and develop the notion of symmetric monoidal sketch. Every symmetric monoidal sketch generates a generic model. If the sketch is commutative and single-sorted, the gen...