815 search results - page 14 / 163 » Algebraic Recognizability of Languages |
COCOON
1999
Springer
15 years 1 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
75
Voted
IFIP
1994
Springer
15 years 1 months ago
1994
Springer
The paper surveys the work which has been done from 1986-1994 on speci cations of logic programming systems by evolving algebras. 1
DLT
1993
14 years 10 months ago
1993
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
133
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
This article proposes a core query algebra for probabilistic databases. In essence, this core is part of the query languages of most probabilistic database systems proposed so far...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...