Sciweavers

6 search results - page 1 / 2
» Divisibility Monoids: Presentation, Word Problem, and Ration...
Sort
View
FCT
2001
Springer
13 years 9 months ago
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
Abstract. We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We ...
Dietrich Kuske
MFCS
2005
Springer
13 years 10 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
FOSSACS
2001
Springer
13 years 9 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
ICALP
2005
Springer
13 years 10 months ago
On Dynamic Bit-Probe Complexity
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Corina E. Patrascu, Mihai Patrascu
JLP
2007
159views more  JLP 2007»
13 years 4 months ago
Reasoning about interaction protocols for customizing web service selection and composition
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...