Sciweavers

15 search results - page 1 / 3
» A Complete Theory of Deterministic Event Structures
Sort
View
REX
1993
13 years 9 months ago
Relationships Between Models of Concurrency
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
Mogens Nielsen, Vladimiro Sassone, Glynn Winskel
LFCS
2009
Springer
13 years 10 months ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington
SEMCO
2009
IEEE
14 years 10 days ago
Understanding Implicit Entities and Events with Getaruns
- Semantic processing represents the new challenge for all applications that require text understanding, as for instance Q/A. In this paper we will highlight the need to couple sta...
Rodolfo Delmonte
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 9 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...