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...
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...
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...
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...
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...
Carsten Lund, Lance Fortnow, Howard J. Karloff, No...