815 search results - page 90 / 163 » Algebraic Recognizability of Languages |
262
click to vote
ICDT
2009
ACM
16 years 6 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
149
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
135
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...
135
click to vote
APLAS
2003
ACM
15 years 11 months ago
2003
ACM
The chi calculus is studied in the framework incorporating two constructions widely useful in applications: asymmetric communication and mismatch condition. The barbed bisimilarity...
176
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...