1209 search results - page 29 / 242 » Universal Algebra and Computer Science |
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
RELMICS
2009
Springer
14 years 3 months ago
2009
Springer
Using relation algebra, we generalize Aumann’s notion of a contact relation and that of a closure operation from powersets to general membership relations and their induced parti...
MFCS
1991
Springer
14 years 5 days ago
1991
Springer
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
NIME
2005
Springer
14 years 2 months ago
2005
Springer
Electronic Musical Instrument Design is an excellent vehicle for bringing students from multiple disciplines together to work on projects, and help bridge the perennial gap betwee...
FOCS
1990
IEEE
14 years 21 days ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...