1916 search results - page 133 / 384 » Reasoning with class algebra |
127
Voted
COCO
1993
Springer
15 years 4 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
89
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
83
Voted
MOVEP
2000
15 years 4 months ago
2000
We propose a short bibliographic survey of calculi for mobile processes. Contrasting with other similar exercises, we consider two related, but distinct, notions of mobile processe...
86
Voted
CIE
2006
Springer
15 years 2 months ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
101
click to vote
DLT
2006
15 years 2 months ago
2006
Abstract. We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To th...