1537 search results - page 144 / 308 » On sets not belonging to algebras |
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
Pregroups had been conceived as an algebraic tool to recognize grammatically well-formed sentences in natural languages [3]. Here we wish to use pregroups to recognize well-formed...
107
click to vote
FSE
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We present a new stream cipher, Rabbit, based on iterating a set of coupled nonlinear functions. Rabbit is characterized by a high performance in software with a measured...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
CTCS
1997
Springer
15 years 2 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
FSTTCS
1993
Springer
15 years 2 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...